YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 10:10:26,643 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 10:10:26,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 10:10:26,656 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 10:10:26,657 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 10:10:26,658 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 10:10:26,659 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 10:10:26,660 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 10:10:26,662 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 10:10:26,663 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 10:10:26,664 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 10:10:26,664 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 10:10:26,665 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 10:10:26,666 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 10:10:26,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 10:10:26,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 10:10:26,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 10:10:26,670 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 10:10:26,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 10:10:26,673 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 10:10:26,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 10:10:26,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 10:10:26,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 10:10:26,678 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 10:10:26,678 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 10:10:26,679 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 10:10:26,679 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 10:10:26,680 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 10:10:26,680 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 10:10:26,681 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 10:10:26,681 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 10:10:26,682 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 10:10:26,683 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 10:10:26,683 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 10:10:26,684 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 10:10:26,684 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 10:10:26,684 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 10:10:26,685 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 10:10:26,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 10:10:26,686 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 10:10:26,700 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 10:10:26,701 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 10:10:26,702 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 10:10:26,702 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 10:10:26,702 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 10:10:26,702 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:10:26,703 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 10:10:26,703 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 10:10:26,703 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 10:10:26,703 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 10:10:26,703 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 10:10:26,703 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 10:10:26,704 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 10:10:26,704 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 10:10:26,704 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 10:10:26,704 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 10:10:26,704 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 10:10:26,705 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 10:10:26,705 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 10:10:26,705 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 10:10:26,705 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 10:10:26,705 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 10:10:26,706 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 10:10:26,706 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 10:10:26,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:10:26,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 10:10:26,706 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 10:10:26,706 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 10:10:26,707 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 10:10:26,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 10:10:26,747 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 10:10:26,751 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 10:10:26,752 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 10:10:26,752 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 10:10:26,753 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:10:26,819 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/34d8706f701b430c8dd008303cd64203/FLAG4c587fc2e [2020-06-22 10:10:27,167 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 10:10:27,168 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 10:10:27,168 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 10:10:27,174 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/34d8706f701b430c8dd008303cd64203/FLAG4c587fc2e [2020-06-22 10:10:27,570 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/34d8706f701b430c8dd008303cd64203 [2020-06-22 10:10:27,581 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 10:10:27,583 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 10:10:27,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 10:10:27,584 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 10:10:27,588 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 10:10:27,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@abb851b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27, skipping insertion in model container [2020-06-22 10:10:27,592 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 10:10:27,617 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 10:10:27,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:10:27,838 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 10:10:27,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 10:10:27,871 INFO L195 MainTranslator]: Completed translation [2020-06-22 10:10:27,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27 WrapperNode [2020-06-22 10:10:27,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 10:10:27,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 10:10:27,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 10:10:27,872 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 10:10:27,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 10:10:27,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 10:10:27,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 10:10:27,912 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 10:10:27,921 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,921 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,923 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,927 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,932 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... [2020-06-22 10:10:27,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 10:10:27,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 10:10:27,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 10:10:27,935 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 10:10:27,936 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 10:10:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 10:10:28,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 10:10:28,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 10:10:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 10:10:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 10:10:28,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 10:10:28,209 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 10:10:28,210 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2020-06-22 10:10:28,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28 BoogieIcfgContainer [2020-06-22 10:10:28,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 10:10:28,212 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 10:10:28,212 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 10:10:28,214 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 10:10:28,215 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28" (1/1) ... [2020-06-22 10:10:28,231 INFO L313 BlockEncoder]: Initial Icfg 33 locations, 35 edges [2020-06-22 10:10:28,232 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 10:10:28,233 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 10:10:28,234 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 10:10:28,234 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 10:10:28,236 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 10:10:28,237 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 10:10:28,237 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 10:10:28,257 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 10:10:28,281 INFO L200 BlockEncoder]: SBE split 14 edges [2020-06-22 10:10:28,287 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-06-22 10:10:28,289 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:10:28,350 INFO L100 BaseMinimizeStates]: Removed 20 edges and 10 locations by large block encoding [2020-06-22 10:10:28,353 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 10:10:28,355 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:10:28,355 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:10:28,359 INFO L100 BaseMinimizeStates]: Removed 2 edges and 1 locations by large block encoding [2020-06-22 10:10:28,359 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:10:28,360 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 10:10:28,360 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 10:10:28,360 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 10:10:28,361 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 10:10:28,361 INFO L313 BlockEncoder]: Encoded RCFG 21 locations, 36 edges [2020-06-22 10:10:28,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:10:28 BasicIcfg [2020-06-22 10:10:28,362 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 10:10:28,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 10:10:28,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 10:10:28,366 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 10:10:28,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 10:10:27" (1/4) ... [2020-06-22 10:10:28,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca42a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:10:28, skipping insertion in model container [2020-06-22 10:10:28,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (2/4) ... [2020-06-22 10:10:28,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca42a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 10:10:28, skipping insertion in model container [2020-06-22 10:10:28,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28" (3/4) ... [2020-06-22 10:10:28,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca42a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:10:28, skipping insertion in model container [2020-06-22 10:10:28,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:10:28" (4/4) ... [2020-06-22 10:10:28,371 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:10:28,381 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 10:10:28,389 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 12 error locations. [2020-06-22 10:10:28,405 INFO L257 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2020-06-22 10:10:28,433 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:10:28,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 10:10:28,434 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 10:10:28,434 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:10:28,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:10:28,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:10:28,435 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 10:10:28,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:10:28,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 10:10:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-06-22 10:10:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:10:28,456 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:28,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:10:28,457 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:10:28,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:28,463 INFO L82 PathProgramCache]: Analyzing trace with hash 100327, now seen corresponding path program 1 times [2020-06-22 10:10:28,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:28,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:28,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:28,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:10:28,625 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:28,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:28,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:28,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,645 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2020-06-22 10:10:28,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:28,741 INFO L93 Difference]: Finished difference Result 21 states and 36 transitions. [2020-06-22 10:10:28,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:28,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:10:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:28,755 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:10:28,755 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 10:10:28,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 10:10:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-06-22 10:10:28,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:10:28,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 24 transitions. [2020-06-22 10:10:28,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 24 transitions. Word has length 3 [2020-06-22 10:10:28,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:28,794 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 24 transitions. [2020-06-22 10:10:28,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:28,794 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 24 transitions. [2020-06-22 10:10:28,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:10:28,794 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:28,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:10:28,795 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:10:28,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:28,795 INFO L82 PathProgramCache]: Analyzing trace with hash 100329, now seen corresponding path program 1 times [2020-06-22 10:10:28,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:28,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:28,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:28,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:10:28,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:28,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:28,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:28,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:28,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,818 INFO L87 Difference]: Start difference. First operand 15 states and 24 transitions. Second operand 3 states. [2020-06-22 10:10:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:28,871 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-06-22 10:10:28,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:28,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:10:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:28,872 INFO L225 Difference]: With dead ends: 21 [2020-06-22 10:10:28,873 INFO L226 Difference]: Without dead ends: 15 [2020-06-22 10:10:28,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-06-22 10:10:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-06-22 10:10:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-06-22 10:10:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2020-06-22 10:10:28,877 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 3 [2020-06-22 10:10:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:28,877 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2020-06-22 10:10:28,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:28,878 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2020-06-22 10:10:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-06-22 10:10:28,878 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 10:10:28,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-06-22 10:10:28,878 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 10:10:28,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:28,879 INFO L82 PathProgramCache]: Analyzing trace with hash 100330, now seen corresponding path program 1 times [2020-06-22 10:10:28,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:28,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:28,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:28,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:10:28,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 10:10:28,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 10:10:28,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 10:10:28,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 10:10:28,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,919 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand 3 states. [2020-06-22 10:10:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 10:10:28,959 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2020-06-22 10:10:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 10:10:28,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-06-22 10:10:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 10:10:28,960 INFO L225 Difference]: With dead ends: 15 [2020-06-22 10:10:28,961 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 10:10:28,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 10:10:28,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 10:10:28,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 10:10:28,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 10:10:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 10:10:28,962 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 3 [2020-06-22 10:10:28,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 10:10:28,962 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:28,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 10:10:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:10:28,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 10:10:28,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 10:10:28,986 INFO L448 ceAbstractionStarter]: For program point L13(line 13) no Hoare annotation was computed. [2020-06-22 10:10:28,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:10:28,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,987 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:10:28,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-06-22 10:10:28,988 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 20) no Hoare annotation was computed. [2020-06-22 10:10:28,988 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 15 21) the Hoare annotation is: (and (= (select |#valid| ~x~0.base) 1) (= ~x~0.offset 0) (= (select |#length| ~x~0.base) 4)) [2020-06-22 10:10:28,988 INFO L448 ceAbstractionStarter]: For program point L8(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,988 INFO L448 ceAbstractionStarter]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,989 INFO L448 ceAbstractionStarter]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,989 INFO L448 ceAbstractionStarter]: For program point L8-6(line 8) no Hoare annotation was computed. [2020-06-22 10:10:28,989 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 10:10:28,997 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:29,002 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:29,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:10:29 BasicIcfg [2020-06-22 10:10:29,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 10:10:29,005 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 10:10:29,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 10:10:29,008 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 10:10:29,009 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:29,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 10:10:27" (1/5) ... [2020-06-22 10:10:29,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61b31896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:10:29, skipping insertion in model container [2020-06-22 10:10:29,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:29,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 10:10:27" (2/5) ... [2020-06-22 10:10:29,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61b31896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 10:10:29, skipping insertion in model container [2020-06-22 10:10:29,010 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:29,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 10:10:28" (3/5) ... [2020-06-22 10:10:29,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61b31896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:10:29, skipping insertion in model container [2020-06-22 10:10:29,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:29,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 10:10:28" (4/5) ... [2020-06-22 10:10:29,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61b31896 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:10:29, skipping insertion in model container [2020-06-22 10:10:29,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 10:10:29,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 10:10:29" (5/5) ... [2020-06-22 10:10:29,013 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 10:10:29,034 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 10:10:29,035 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 10:10:29,035 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 10:10:29,035 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 10:10:29,035 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 10:10:29,035 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 10:10:29,035 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 10:10:29,035 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 10:10:29,035 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 10:10:29,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-06-22 10:10:29,044 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:10:29,044 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:29,044 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:29,049 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:10:29,049 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:10:29,049 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 10:10:29,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states. [2020-06-22 10:10:29,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-06-22 10:10:29,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 10:10:29,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 10:10:29,051 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 10:10:29,052 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-06-22 10:10:29,057 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue [70] ULTIMATE.startENTRY-->L-1: Formula: (and (= |v_#NULL.offset_1| 0) (= |v_#NULL.base_1| 0) (= v_~x~0.offset_1 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= v_~x~0.base_1 0)) InVars {#valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, ~x~0.base=v_~x~0.base_1, ~x~0.offset=v_~x~0.offset_1, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[~x~0.base, ~x~0.offset, #valid, #NULL.offset, #NULL.base] 13#L-1true [103] L-1-->L13: Formula: (and (= v_~x~0.base_2 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_#length_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= v_~x~0.offset_2 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc2.base_1| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc2.base_1|) 0) (< |v_ULTIMATE.start_main_#t~malloc2.base_1| |v_#StackHeapBarrier_1|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{~x~0.offset=v_~x~0.offset_2, ~x~0.base=v_~x~0.base_2, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_1|, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, #length=|v_#length_1|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_1|, ULTIMATE.start_main_#t~ret6=|v_ULTIMATE.start_main_#t~ret6_1|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_1|} AuxVars[] AssignedVars[~x~0.offset, ~x~0.base, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_#t~nondet3, #valid, #length, ULTIMATE.start_main_#t~ret7, ULTIMATE.start_main_#t~ret6, ULTIMATE.start_main_#t~mem4] 19#L13true [130] L13-->L16-2: Formula: (and (<= 0 v_~x~0.offset_15) (= (store |v_#memory_int_11| v_~x~0.base_21 (store (select |v_#memory_int_11| v_~x~0.base_21) v_~x~0.offset_15 |v_ULTIMATE.start_main_#t~nondet3_5|)) |v_#memory_int_10|) (= 1 (select |v_#valid_19| v_~x~0.base_21)) (<= (+ v_~x~0.offset_15 4) (select |v_#length_15| v_~x~0.base_21))) InVars {~x~0.base=v_~x~0.base_21, ~x~0.offset=v_~x~0.offset_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_5|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} OutVars{~x~0.base=v_~x~0.base_21, ~x~0.offset=v_~x~0.offset_15, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, #memory_int] 21#L16-2true [2020-06-22 10:10:29,057 INFO L796 eck$LassoCheckResult]: Loop: 21#L16-2true [140] L16-2-->L16: Formula: (and (= 1 (select |v_#valid_32| v_~x~0.base_28)) (< 0 (select (select |v_#memory_int_22| v_~x~0.base_28) v_~x~0.offset_22)) (<= 0 v_~x~0.offset_22) (<= (+ v_~x~0.offset_22 4) (select |v_#length_22| v_~x~0.base_28))) InVars {~x~0.base=v_~x~0.base_28, ~x~0.offset=v_~x~0.offset_22, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{~x~0.base=v_~x~0.base_28, ~x~0.offset=v_~x~0.offset_22, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|, ULTIMATE.start_main_#t~mem4=|v_ULTIMATE.start_main_#t~mem4_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem4] 5#L16true [53] L16-->L8-4: Formula: (= 0 |v_ULTIMATE.start_main_#t~nondet5_5|) InVars {ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_5|} OutVars{ULTIMATE.start_foo_#res=|v_ULTIMATE.start_foo_#res_3|, ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_5|, ULTIMATE.start_main_#t~nondet5=|v_ULTIMATE.start_main_#t~nondet5_4|, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_5|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_main_#t~nondet5, ULTIMATE.start_foo_#t~mem0, ULTIMATE.start_foo_#res] 23#L8-4true [133] L8-4-->L8-6: Formula: (and (= |v_ULTIMATE.start_foo_#t~mem0_9| (select (select |v_#memory_int_12| v_~x~0.base_22) v_~x~0.offset_16)) (<= 0 v_~x~0.offset_16) (= 1 (select |v_#valid_24| v_~x~0.base_22)) (= |v_ULTIMATE.start_foo_#t~post1_9| |v_ULTIMATE.start_foo_#t~mem0_9|) (<= (+ v_~x~0.offset_16 4) (select |v_#length_16| v_~x~0.base_22))) InVars {~x~0.base=v_~x~0.base_22, ~x~0.offset=v_~x~0.offset_16, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_9|, ~x~0.base=v_~x~0.base_22, ~x~0.offset=v_~x~0.offset_16, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~mem0] 18#L8-6true [138] L8-6-->L16-2: Formula: (and (<= (+ v_~x~0.offset_20 4) (select |v_#length_20| v_~x~0.base_26)) (= (store |v_#memory_int_19| v_~x~0.base_26 (store (select |v_#memory_int_19| v_~x~0.base_26) v_~x~0.offset_20 (+ |v_ULTIMATE.start_foo_#t~post1_16| (- 1)))) |v_#memory_int_18|) (= 1 (select |v_#valid_30| v_~x~0.base_26)) (<= 0 v_~x~0.offset_20)) InVars {ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_16|, ~x~0.base=v_~x~0.base_26, ~x~0.offset=v_~x~0.offset_20, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_19|, #length=|v_#length_20|} OutVars{ULTIMATE.start_foo_#t~post1=|v_ULTIMATE.start_foo_#t~post1_15|, ~x~0.base=v_~x~0.base_26, ~x~0.offset=v_~x~0.offset_20, ULTIMATE.start_foo_#t~mem0=|v_ULTIMATE.start_foo_#t~mem0_13|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_main_#t~ret7=|v_ULTIMATE.start_main_#t~ret7_4|, #length=|v_#length_20|} AuxVars[] AssignedVars[ULTIMATE.start_foo_#t~post1, ULTIMATE.start_foo_#t~mem0, #memory_int, ULTIMATE.start_main_#t~ret7] 21#L16-2true [2020-06-22 10:10:29,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,058 INFO L82 PathProgramCache]: Analyzing trace with hash 100384, now seen corresponding path program 1 times [2020-06-22 10:10:29,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:29,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash 5149455, now seen corresponding path program 1 times [2020-06-22 10:10:29,096 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:29,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1778322514, now seen corresponding path program 1 times [2020-06-22 10:10:29,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 10:10:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 10:10:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 10:10:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 10:10:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:29,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:29,297 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2020-06-22 10:10:29,358 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 10:10:29,360 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 10:10:29,360 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 10:10:29,360 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 10:10:29,360 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 10:10:29,360 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 10:10:29,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 10:10:29,361 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 10:10:29,361 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-06-22 10:10:29,361 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 10:10:29,361 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 10:10:29,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 10:10:29,768 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 10:10:29,774 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 10:10:29,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,790 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:29,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,793 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:29,793 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:29,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:29,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,797 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:29,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:29,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,800 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:29,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,801 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:29,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:29,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,803 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,804 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,806 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:29,806 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:29,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:29,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,813 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,813 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:29,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:29,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 10:10:29,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,818 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 10:10:29,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 10:10:29,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,823 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:29,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:29,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:29,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:29,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 10:10:29,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-06-22 10:10:29,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 10:10:29,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 10:10:29,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 10:10:29,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 10:10:29,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 10:10:29,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 10:10:29,867 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 10:10:29,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 10:10:29,882 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 10:10:29,885 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 10:10:29,887 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 10:10:29,887 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 10:10:29,887 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1) = 1*v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1 Supporting invariants [] [2020-06-22 10:10:29,899 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-06-22 10:10:29,902 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-06-22 10:10:29,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 10:10:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:29,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 10:10:29,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 10:10:29,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 6 conjunts are in the unsatisfiable core [2020-06-22 10:10:29,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 10:10:29,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 10:10:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 10:10:30,032 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-06-22 10:10:30,032 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 10:10:30,035 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-06-22 10:10:30,036 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 21 states. Second operand 4 states. [2020-06-22 10:10:30,170 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 21 states.. Second operand 4 states. Result 37 states and 72 transitions. Complement of second has 8 states. [2020-06-22 10:10:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-06-22 10:10:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 10:10:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2020-06-22 10:10:30,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 4 letters. [2020-06-22 10:10:30,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:30,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 7 letters. Loop has 4 letters. [2020-06-22 10:10:30,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:30,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 65 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 10:10:30,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 10:10:30,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 72 transitions. [2020-06-22 10:10:30,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:10:30,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2020-06-22 10:10:30,188 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 10:10:30,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 10:10:30,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 10:10:30,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 10:10:30,189 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:30,189 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:30,189 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 10:10:30,189 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 10:10:30,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 10:10:30,189 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 10:10:30,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 10:10:30,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 10:10:30 BasicIcfg [2020-06-22 10:10:30,195 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 10:10:30,196 INFO L168 Benchmark]: Toolchain (without parser) took 2613.72 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 559.9 MB in the beginning and 423.0 MB in the end (delta: 136.9 MB). Peak memory consumption was 178.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,197 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 10:10:30,197 INFO L168 Benchmark]: CACSL2BoogieTranslator took 287.51 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 559.9 MB in the beginning and 654.8 MB in the end (delta: -94.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,198 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.24 ms. Allocated memory is still 691.0 MB. Free memory was 654.8 MB in the beginning and 652.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,198 INFO L168 Benchmark]: Boogie Preprocessor took 22.60 ms. Allocated memory is still 691.0 MB. Free memory was 652.5 MB in the beginning and 651.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,199 INFO L168 Benchmark]: RCFGBuilder took 277.04 ms. Allocated memory is still 691.0 MB. Free memory was 651.4 MB in the beginning and 631.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,200 INFO L168 Benchmark]: BlockEncodingV2 took 150.26 ms. Allocated memory is still 691.0 MB. Free memory was 631.4 MB in the beginning and 622.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,200 INFO L168 Benchmark]: TraceAbstraction took 641.45 ms. Allocated memory is still 691.0 MB. Free memory was 621.7 MB in the beginning and 567.6 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,201 INFO L168 Benchmark]: BuchiAutomizer took 1190.29 ms. Allocated memory is still 691.0 MB. Free memory was 567.6 MB in the beginning and 423.0 MB in the end (delta: 144.6 MB). Peak memory consumption was 144.6 MB. Max. memory is 50.3 GB. [2020-06-22 10:10:30,205 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 33 locations, 35 edges - StatisticsResult: Encoded RCFG 21 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 585.8 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 287.51 ms. Allocated memory was 649.6 MB in the beginning and 691.0 MB in the end (delta: 41.4 MB). Free memory was 559.9 MB in the beginning and 654.8 MB in the end (delta: -94.9 MB). Peak memory consumption was 29.2 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 39.24 ms. Allocated memory is still 691.0 MB. Free memory was 654.8 MB in the beginning and 652.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 22.60 ms. Allocated memory is still 691.0 MB. Free memory was 652.5 MB in the beginning and 651.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 50.3 GB. * RCFGBuilder took 277.04 ms. Allocated memory is still 691.0 MB. Free memory was 651.4 MB in the beginning and 631.4 MB in the end (delta: 20.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 150.26 ms. Allocated memory is still 691.0 MB. Free memory was 631.4 MB in the beginning and 622.7 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 641.45 ms. Allocated memory is still 691.0 MB. Free memory was 621.7 MB in the beginning and 567.6 MB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1190.29 ms. Allocated memory is still 691.0 MB. Free memory was 567.6 MB in the beginning and 423.0 MB in the end (delta: 144.6 MB). Peak memory consumption was 144.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-06-22 10:10:30,216 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 10:10:30,217 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (\valid[x] == 1 && x == 0) && unknown-#length-unknown[x] == 4 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 21 locations, 12 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6 SDtfs, 45 SDslu, 0 SDs, 0 SdLazy, 50 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 1 NumberOfFragments, 14 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 9 NumberOfCodeBlocks, 9 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 40 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.1s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.8s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 9 SDtfs, 91 SDslu, 3 SDs, 0 SdLazy, 106 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital106 mio100 ax100 hnf100 lsp88 ukn69 mio100 lsp41 div100 bol100 ite100 ukn100 eq144 hnf92 smp83 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-06-22 10:10:24.285 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 10:10:30.444 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check