java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-regression/test25_false-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:16,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:16,651 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:16,671 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:16,671 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:16,672 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:16,674 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:16,676 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:16,677 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:16,678 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:16,679 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:16,679 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:16,680 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:16,681 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:16,683 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:16,683 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:16,684 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:16,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:16,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:16,690 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:16,691 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:16,693 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:16,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:16,696 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:16,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:16,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:16,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:16,699 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:16,700 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:16,701 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:16,701 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:16,702 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:16,702 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:16,703 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:16,704 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:16,705 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:16,705 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:54:16,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:54:16,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:54:16,728 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:54:16,729 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:54:16,729 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:16,729 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:54:16,730 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:54:16,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:54:16,730 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:16,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:54:16,731 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:54:16,731 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:54:16,731 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:16,731 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:16,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:54:16,732 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:54:16,732 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:16,732 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:16,732 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:16,732 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:16,733 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:16,733 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:16,733 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:16,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:16,733 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:16,735 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:16,787 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:16,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:16,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:16,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:16,806 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:16,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-23 12:54:16,867 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e06c925/0dfe37a7c7e64943aebabbc435c9c9ae/FLAGbf9c4490f [2018-11-23 12:54:17,361 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:17,362 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25_false-unreach-call_true-termination.c [2018-11-23 12:54:17,370 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e06c925/0dfe37a7c7e64943aebabbc435c9c9ae/FLAGbf9c4490f [2018-11-23 12:54:17,710 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e06c925/0dfe37a7c7e64943aebabbc435c9c9ae [2018-11-23 12:54:17,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:17,722 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:17,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:17,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:17,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:17,729 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f11a8af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:17, skipping insertion in model container [2018-11-23 12:54:17,732 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:54:17" (1/1) ... [2018-11-23 12:54:17,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:17,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:18,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:18,046 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:18,078 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:18,105 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:18,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18 WrapperNode [2018-11-23 12:54:18,106 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:18,107 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:18,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:18,107 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:18,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:18,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:18,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:18,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:18,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,166 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... [2018-11-23 12:54:18,187 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:18,187 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:18,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:18,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:18,189 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:18,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:54:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:18,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:18,312 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 12:54:18,313 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 12:54:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:54:18,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:18,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:18,973 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:54:18,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:18 BoogieIcfgContainer [2018-11-23 12:54:18,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:18,975 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:18,975 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:18,978 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:18,979 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:54:17" (1/3) ... [2018-11-23 12:54:18,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4c17af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:18, skipping insertion in model container [2018-11-23 12:54:18,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:54:18" (2/3) ... [2018-11-23 12:54:18,980 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f4c17af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:54:18, skipping insertion in model container [2018-11-23 12:54:18,980 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:18" (3/3) ... [2018-11-23 12:54:18,982 INFO L112 eAbstractionObserver]: Analyzing ICFG test25_false-unreach-call_true-termination.c [2018-11-23 12:54:18,993 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:19,002 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:19,020 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:19,053 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:19,054 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:19,054 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:19,054 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:19,055 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:19,055 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:19,055 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:19,055 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:19,055 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:19,075 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:54:19,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:54:19,082 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:19,083 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:19,086 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:19,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:19,093 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-23 12:54:19,095 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:19,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:19,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:19,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:54:19,272 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-23 12:54:19,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:19,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #58#return; {28#true} is VALID [2018-11-23 12:54:19,274 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret13 := main(); {28#true} is VALID [2018-11-23 12:54:19,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {28#true} is VALID [2018-11-23 12:54:19,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:54:19,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {29#false} is VALID [2018-11-23 12:54:19,280 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {29#false} is VALID [2018-11-23 12:54:19,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-23 12:54:19,280 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {28#true} is VALID [2018-11-23 12:54:19,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {28#true} is VALID [2018-11-23 12:54:19,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:19,281 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #62#return; {29#false} is VALID [2018-11-23 12:54:19,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {29#false} is VALID [2018-11-23 12:54:19,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret12;havoc #t~ret12; {29#false} is VALID [2018-11-23 12:54:19,282 INFO L273 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:54:19,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:19,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:19,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:19,294 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:19,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:19,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:54:19,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:19,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:54:19,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:19,479 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:54:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,606 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 12:54:19,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:19,606 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:19,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:54:19,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 52 transitions. [2018-11-23 12:54:19,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 52 transitions. [2018-11-23 12:54:19,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:19,901 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:54:19,901 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:54:19,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:54:19,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:54:19,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:19,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,986 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,987 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,991 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:19,991 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:19,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:19,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:19,992 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,992 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,996 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:19,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:19,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:19,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:19,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:20,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:54:20,003 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:54:20,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:20,003 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:54:20,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:54:20,003 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:20,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:54:20,004 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:20,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:20,005 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:20,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:20,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-23 12:54:20,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:20,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:20,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 12:54:20,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {156#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {156#true} is VALID [2018-11-23 12:54:20,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:20,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #58#return; {156#true} is VALID [2018-11-23 12:54:20,109 INFO L256 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret13 := main(); {156#true} is VALID [2018-11-23 12:54:20,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {158#(= main_~j~0 0)} is VALID [2018-11-23 12:54:20,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#(= main_~j~0 0)} assume !(~j~0 < 10); {157#false} is VALID [2018-11-23 12:54:20,114 INFO L273 TraceCheckUtils]: 7: Hoare triple {157#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {157#false} is VALID [2018-11-23 12:54:20,114 INFO L273 TraceCheckUtils]: 8: Hoare triple {157#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {157#false} is VALID [2018-11-23 12:54:20,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {157#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {157#false} is VALID [2018-11-23 12:54:20,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {157#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {157#false} is VALID [2018-11-23 12:54:20,115 INFO L256 TraceCheckUtils]: 11: Hoare triple {157#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {156#true} is VALID [2018-11-23 12:54:20,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {156#true} is VALID [2018-11-23 12:54:20,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:20,116 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {156#true} {157#false} #62#return; {157#false} is VALID [2018-11-23 12:54:20,117 INFO L273 TraceCheckUtils]: 15: Hoare triple {157#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {157#false} is VALID [2018-11-23 12:54:20,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {157#false} assume 0 == #t~ret12;havoc #t~ret12; {157#false} is VALID [2018-11-23 12:54:20,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 12:54:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:20,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:20,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:54:20,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:20,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:20,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:54:20,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:20,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:54:20,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:54:20,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:54:20,254 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 12:54:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,420 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:54:20,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:54:20,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:20,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:20,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:20,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:20,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:20,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:20,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:54:20,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:20,642 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:20,642 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:54:20,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:54:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:54:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 12:54:20,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:20,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:20,782 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:20,782 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:20,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,787 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:20,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:20,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:20,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:20,788 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:20,788 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,791 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:20,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:20,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:20,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:20,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:20,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:20,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:54:20,794 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 12:54:20,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:20,794 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:54:20,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:54:20,794 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:54:20,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:54:20,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:20,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:20,796 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:20,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-23 12:54:20,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:20,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:20,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 12:54:20,942 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:20,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #58#return; {284#true} is VALID [2018-11-23 12:54:20,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret13 := main(); {284#true} is VALID [2018-11-23 12:54:20,948 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:20,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:20,953 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:20,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 10); {285#false} is VALID [2018-11-23 12:54:20,955 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {285#false} is VALID [2018-11-23 12:54:20,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {285#false} is VALID [2018-11-23 12:54:20,956 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:20,956 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {285#false} is VALID [2018-11-23 12:54:20,956 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {284#true} is VALID [2018-11-23 12:54:20,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {284#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {284#true} is VALID [2018-11-23 12:54:20,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:20,957 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {284#true} {285#false} #62#return; {285#false} is VALID [2018-11-23 12:54:20,958 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:20,958 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret12;havoc #t~ret12; {285#false} is VALID [2018-11-23 12:54:20,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:20,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:20,960 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:20,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:21,338 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:21,339 INFO L273 TraceCheckUtils]: 1: Hoare triple {284#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {284#true} is VALID [2018-11-23 12:54:21,339 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:21,339 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #58#return; {284#true} is VALID [2018-11-23 12:54:21,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret13 := main(); {284#true} is VALID [2018-11-23 12:54:21,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:21,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:21,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:21,348 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 10); {285#false} is VALID [2018-11-23 12:54:21,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {285#false} is VALID [2018-11-23 12:54:21,349 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {285#false} is VALID [2018-11-23 12:54:21,349 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:21,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {285#false} is VALID [2018-11-23 12:54:21,349 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {285#false} is VALID [2018-11-23 12:54:21,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {285#false} is VALID [2018-11-23 12:54:21,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#false} assume true; {285#false} is VALID [2018-11-23 12:54:21,350 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {285#false} {285#false} #62#return; {285#false} is VALID [2018-11-23 12:54:21,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:21,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret12;havoc #t~ret12; {285#false} is VALID [2018-11-23 12:54:21,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:21,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:21,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:54:21,373 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:21,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:21,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:21,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:21,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:21,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:21,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:21,526 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 12:54:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:21,716 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:54:21,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:21,717 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:21,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:21,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:21,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 12:54:21,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:21,849 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:54:21,849 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:54:21,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:54:21,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 12:54:21,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:21,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:21,876 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:21,876 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:21,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:21,878 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:21,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:21,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:21,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:21,879 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:21,879 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:21,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:21,882 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:21,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:21,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:21,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:21,883 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:54:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:54:21,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 12:54:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:21,885 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:54:21,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:54:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:54:21,886 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:21,886 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:21,887 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:21,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-23 12:54:21,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:21,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:21,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:21,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:21,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:22,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:22,050 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-23 12:54:22,050 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:22,051 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #58#return; {481#true} is VALID [2018-11-23 12:54:22,051 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret13 := main(); {481#true} is VALID [2018-11-23 12:54:22,053 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:22,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:22,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,055 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {485#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:22,056 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#(<= main_~j~0 2)} assume !(~j~0 < 10); {482#false} is VALID [2018-11-23 12:54:22,057 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {482#false} is VALID [2018-11-23 12:54:22,057 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {482#false} is VALID [2018-11-23 12:54:22,057 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {482#false} is VALID [2018-11-23 12:54:22,058 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {482#false} is VALID [2018-11-23 12:54:22,058 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {481#true} is VALID [2018-11-23 12:54:22,058 INFO L273 TraceCheckUtils]: 16: Hoare triple {481#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {481#true} is VALID [2018-11-23 12:54:22,058 INFO L273 TraceCheckUtils]: 17: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:22,058 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {481#true} {482#false} #62#return; {482#false} is VALID [2018-11-23 12:54:22,059 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:22,059 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret12;havoc #t~ret12; {482#false} is VALID [2018-11-23 12:54:22,059 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:22,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:22,060 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:22,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:22,101 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:54:22,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:22,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:22,337 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:22,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:22,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:22,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:22,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:22,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:22,372 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:22,372 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= (+ main_~i~0 10) .cse0) (<= .cse0 |main_#t~mem10|))) [2018-11-23 12:54:22,372 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 10) |main_#t~mem10|) [2018-11-23 12:54:22,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:22,402 INFO L273 TraceCheckUtils]: 1: Hoare triple {481#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {481#true} is VALID [2018-11-23 12:54:22,402 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:22,403 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #58#return; {481#true} is VALID [2018-11-23 12:54:22,403 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret13 := main(); {481#true} is VALID [2018-11-23 12:54:22,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {481#true} is VALID [2018-11-23 12:54:22,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {481#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {481#true} is VALID [2018-11-23 12:54:22,404 INFO L273 TraceCheckUtils]: 7: Hoare triple {481#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {481#true} is VALID [2018-11-23 12:54:22,404 INFO L273 TraceCheckUtils]: 8: Hoare triple {481#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {481#true} is VALID [2018-11-23 12:54:22,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {481#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {481#true} is VALID [2018-11-23 12:54:22,405 INFO L273 TraceCheckUtils]: 10: Hoare triple {481#true} assume !(~j~0 < 10); {481#true} is VALID [2018-11-23 12:54:22,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {481#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {522#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:22,411 INFO L273 TraceCheckUtils]: 12: Hoare triple {522#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {526#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:22,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {526#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {530#(<= (+ main_~i~0 10) |main_#t~mem10|)} is VALID [2018-11-23 12:54:22,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {530#(<= (+ main_~i~0 10) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {482#false} is VALID [2018-11-23 12:54:22,414 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {482#false} is VALID [2018-11-23 12:54:22,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {482#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {482#false} is VALID [2018-11-23 12:54:22,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-23 12:54:22,415 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {482#false} {482#false} #62#return; {482#false} is VALID [2018-11-23 12:54:22,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:22,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret12;havoc #t~ret12; {482#false} is VALID [2018-11-23 12:54:22,416 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:22,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:54:22,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:54:22,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-11-23 12:54:22,436 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 12:54:22,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:22,437 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:22,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:22,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:22,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:22,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:22,546 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 8 states. [2018-11-23 12:54:22,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:22,885 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-23 12:54:22,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:54:22,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 12:54:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:22,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:22,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 12:54:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2018-11-23 12:54:22,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2018-11-23 12:54:22,964 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:22,966 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:54:22,967 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:54:22,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:22,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:54:22,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:54:22,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:22,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:22,987 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:22,987 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:22,990 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:22,991 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:22,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:22,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:22,992 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:22,992 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:22,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:22,995 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:22,995 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:22,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:22,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:22,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:22,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:22,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:54:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:54:22,998 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2018-11-23 12:54:22,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:22,998 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:54:22,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:22,998 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:54:22,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:54:22,999 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:22,999 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:23,000 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:23,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:23,000 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 1 times [2018-11-23 12:54:23,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:23,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:23,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:23,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:23,277 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 12:54:23,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {709#true} is VALID [2018-11-23 12:54:23,278 INFO L273 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 12:54:23,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #58#return; {709#true} is VALID [2018-11-23 12:54:23,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret13 := main(); {709#true} is VALID [2018-11-23 12:54:23,294 INFO L273 TraceCheckUtils]: 5: Hoare triple {709#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {711#(= main_~j~0 0)} is VALID [2018-11-23 12:54:23,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {711#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {711#(= main_~j~0 0)} is VALID [2018-11-23 12:54:23,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {711#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {712#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {714#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:23,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#(<= main_~j~0 3)} assume !(~j~0 < 10); {710#false} is VALID [2018-11-23 12:54:23,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {710#false} is VALID [2018-11-23 12:54:23,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {710#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {710#false} is VALID [2018-11-23 12:54:23,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:23,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {710#false} is VALID [2018-11-23 12:54:23,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:23,302 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {710#false} is VALID [2018-11-23 12:54:23,303 INFO L256 TraceCheckUtils]: 19: Hoare triple {710#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {709#true} is VALID [2018-11-23 12:54:23,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {709#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {709#true} is VALID [2018-11-23 12:54:23,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 12:54:23,304 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {709#true} {710#false} #62#return; {710#false} is VALID [2018-11-23 12:54:23,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {710#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {710#false} is VALID [2018-11-23 12:54:23,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {710#false} assume 0 == #t~ret12;havoc #t~ret12; {710#false} is VALID [2018-11-23 12:54:23,305 INFO L273 TraceCheckUtils]: 25: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 12:54:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:23,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:23,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:23,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:23,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:23,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {709#true} call ULTIMATE.init(); {709#true} is VALID [2018-11-23 12:54:23,479 INFO L273 TraceCheckUtils]: 1: Hoare triple {709#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {709#true} is VALID [2018-11-23 12:54:23,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {709#true} assume true; {709#true} is VALID [2018-11-23 12:54:23,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {709#true} {709#true} #58#return; {709#true} is VALID [2018-11-23 12:54:23,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {709#true} call #t~ret13 := main(); {709#true} is VALID [2018-11-23 12:54:23,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {709#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {733#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:23,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {733#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {733#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:23,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {733#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {712#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {712#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {712#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {713#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {713#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {713#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {714#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:23,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {714#(<= main_~j~0 3)} assume !(~j~0 < 10); {710#false} is VALID [2018-11-23 12:54:23,485 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {710#false} is VALID [2018-11-23 12:54:23,485 INFO L273 TraceCheckUtils]: 14: Hoare triple {710#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {710#false} is VALID [2018-11-23 12:54:23,486 INFO L273 TraceCheckUtils]: 15: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:23,486 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {710#false} is VALID [2018-11-23 12:54:23,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {710#false} is VALID [2018-11-23 12:54:23,487 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {710#false} is VALID [2018-11-23 12:54:23,487 INFO L256 TraceCheckUtils]: 19: Hoare triple {710#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {710#false} is VALID [2018-11-23 12:54:23,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {710#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {710#false} is VALID [2018-11-23 12:54:23,488 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#false} assume true; {710#false} is VALID [2018-11-23 12:54:23,488 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {710#false} {710#false} #62#return; {710#false} is VALID [2018-11-23 12:54:23,488 INFO L273 TraceCheckUtils]: 23: Hoare triple {710#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {710#false} is VALID [2018-11-23 12:54:23,489 INFO L273 TraceCheckUtils]: 24: Hoare triple {710#false} assume 0 == #t~ret12;havoc #t~ret12; {710#false} is VALID [2018-11-23 12:54:23,489 INFO L273 TraceCheckUtils]: 25: Hoare triple {710#false} assume !false; {710#false} is VALID [2018-11-23 12:54:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:23,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:23,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:54:23,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:54:23,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:23,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:23,551 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:23,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:23,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:23,552 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-11-23 12:54:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,725 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:54:23,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:23,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-11-23 12:54:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:23,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:23,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:23,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:23,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 12:54:23,889 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:23,891 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:54:23,891 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:54:23,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:54:23,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:54:23,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:23,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:23,910 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:23,910 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:23,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,913 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:23,913 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:23,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:23,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:23,913 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:23,913 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:23,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,915 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:23,915 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:23,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:23,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:23,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:23,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:54:23,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:54:23,918 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 12:54:23,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:23,919 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:54:23,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:54:23,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:54:23,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:23,920 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:23,920 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:23,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:23,921 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 2 times [2018-11-23 12:54:23,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,095 INFO L256 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2018-11-23 12:54:24,095 INFO L273 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {959#true} is VALID [2018-11-23 12:54:24,096 INFO L273 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-23 12:54:24,096 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2018-11-23 12:54:24,096 INFO L256 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2018-11-23 12:54:24,097 INFO L273 TraceCheckUtils]: 5: Hoare triple {959#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {961#(= main_~j~0 0)} is VALID [2018-11-23 12:54:24,098 INFO L273 TraceCheckUtils]: 6: Hoare triple {961#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {961#(= main_~j~0 0)} is VALID [2018-11-23 12:54:24,099 INFO L273 TraceCheckUtils]: 7: Hoare triple {961#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,099 INFO L273 TraceCheckUtils]: 8: Hoare triple {962#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,100 INFO L273 TraceCheckUtils]: 9: Hoare triple {962#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,101 INFO L273 TraceCheckUtils]: 10: Hoare triple {963#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,102 INFO L273 TraceCheckUtils]: 11: Hoare triple {963#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {965#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:24,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#(<= main_~j~0 4)} assume !(~j~0 < 10); {960#false} is VALID [2018-11-23 12:54:24,105 INFO L273 TraceCheckUtils]: 15: Hoare triple {960#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {960#false} is VALID [2018-11-23 12:54:24,105 INFO L273 TraceCheckUtils]: 16: Hoare triple {960#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {960#false} is VALID [2018-11-23 12:54:24,106 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:24,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {960#false} is VALID [2018-11-23 12:54:24,107 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:24,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {960#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {960#false} is VALID [2018-11-23 12:54:24,107 INFO L256 TraceCheckUtils]: 21: Hoare triple {960#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {959#true} is VALID [2018-11-23 12:54:24,108 INFO L273 TraceCheckUtils]: 22: Hoare triple {959#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {959#true} is VALID [2018-11-23 12:54:24,108 INFO L273 TraceCheckUtils]: 23: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-23 12:54:24,108 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {959#true} {960#false} #62#return; {960#false} is VALID [2018-11-23 12:54:24,109 INFO L273 TraceCheckUtils]: 25: Hoare triple {960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {960#false} is VALID [2018-11-23 12:54:24,109 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#false} assume 0 == #t~ret12;havoc #t~ret12; {960#false} is VALID [2018-11-23 12:54:24,109 INFO L273 TraceCheckUtils]: 27: Hoare triple {960#false} assume !false; {960#false} is VALID [2018-11-23 12:54:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:24,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:24,111 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:24,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:24,180 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:24,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:24,362 INFO L256 TraceCheckUtils]: 0: Hoare triple {959#true} call ULTIMATE.init(); {959#true} is VALID [2018-11-23 12:54:24,363 INFO L273 TraceCheckUtils]: 1: Hoare triple {959#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {959#true} is VALID [2018-11-23 12:54:24,363 INFO L273 TraceCheckUtils]: 2: Hoare triple {959#true} assume true; {959#true} is VALID [2018-11-23 12:54:24,363 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {959#true} {959#true} #58#return; {959#true} is VALID [2018-11-23 12:54:24,364 INFO L256 TraceCheckUtils]: 4: Hoare triple {959#true} call #t~ret13 := main(); {959#true} is VALID [2018-11-23 12:54:24,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {959#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {984#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:24,371 INFO L273 TraceCheckUtils]: 6: Hoare triple {984#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {984#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:24,373 INFO L273 TraceCheckUtils]: 7: Hoare triple {984#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {962#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {962#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,374 INFO L273 TraceCheckUtils]: 9: Hoare triple {962#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {963#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {963#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {963#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {964#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,378 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {965#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:24,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {965#(<= main_~j~0 4)} assume !(~j~0 < 10); {960#false} is VALID [2018-11-23 12:54:24,379 INFO L273 TraceCheckUtils]: 15: Hoare triple {960#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {960#false} is VALID [2018-11-23 12:54:24,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {960#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {960#false} is VALID [2018-11-23 12:54:24,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:24,380 INFO L273 TraceCheckUtils]: 18: Hoare triple {960#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {960#false} is VALID [2018-11-23 12:54:24,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {960#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {960#false} is VALID [2018-11-23 12:54:24,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {960#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {960#false} is VALID [2018-11-23 12:54:24,381 INFO L256 TraceCheckUtils]: 21: Hoare triple {960#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {960#false} is VALID [2018-11-23 12:54:24,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {960#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {960#false} is VALID [2018-11-23 12:54:24,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {960#false} assume true; {960#false} is VALID [2018-11-23 12:54:24,382 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {960#false} {960#false} #62#return; {960#false} is VALID [2018-11-23 12:54:24,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {960#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {960#false} is VALID [2018-11-23 12:54:24,382 INFO L273 TraceCheckUtils]: 26: Hoare triple {960#false} assume 0 == #t~ret12;havoc #t~ret12; {960#false} is VALID [2018-11-23 12:54:24,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {960#false} assume !false; {960#false} is VALID [2018-11-23 12:54:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:24,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:54:24,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:54:24,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:24,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:24,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:24,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:24,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:24,471 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2018-11-23 12:54:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,660 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:54:24,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:24,660 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-23 12:54:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:24,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2018-11-23 12:54:24,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,741 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:54:24,742 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:54:24,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:54:24,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:54:24,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:24,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:24,788 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:24,788 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,790 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:24,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,791 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:24,791 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,793 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:24,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:24,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:24,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:54:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 12:54:24,796 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 12:54:24,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:24,797 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 12:54:24,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:54:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:54:24,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:24,798 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:24,798 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:24,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:24,799 INFO L82 PathProgramCache]: Analyzing trace with hash 814278768, now seen corresponding path program 3 times [2018-11-23 12:54:24,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:24,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,376 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 12:54:25,376 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 12:54:25,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:54:25,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #58#return; {1226#true} is VALID [2018-11-23 12:54:25,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret13 := main(); {1226#true} is VALID [2018-11-23 12:54:25,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1228#(= main_~j~0 0)} is VALID [2018-11-23 12:54:25,378 INFO L273 TraceCheckUtils]: 6: Hoare triple {1228#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1228#(= main_~j~0 0)} is VALID [2018-11-23 12:54:25,379 INFO L273 TraceCheckUtils]: 7: Hoare triple {1228#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1229#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:25,379 INFO L273 TraceCheckUtils]: 8: Hoare triple {1229#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1229#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:25,380 INFO L273 TraceCheckUtils]: 9: Hoare triple {1229#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1230#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:25,381 INFO L273 TraceCheckUtils]: 10: Hoare triple {1230#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1230#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:25,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {1230#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1231#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:25,382 INFO L273 TraceCheckUtils]: 12: Hoare triple {1231#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1231#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:25,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {1231#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1232#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:25,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {1232#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1232#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:25,384 INFO L273 TraceCheckUtils]: 15: Hoare triple {1232#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1233#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:25,385 INFO L273 TraceCheckUtils]: 16: Hoare triple {1233#(<= main_~j~0 5)} assume !(~j~0 < 10); {1227#false} is VALID [2018-11-23 12:54:25,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {1227#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1227#false} is VALID [2018-11-23 12:54:25,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {1227#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1227#false} is VALID [2018-11-23 12:54:25,386 INFO L273 TraceCheckUtils]: 19: Hoare triple {1227#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1227#false} is VALID [2018-11-23 12:54:25,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {1227#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1227#false} is VALID [2018-11-23 12:54:25,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1227#false} is VALID [2018-11-23 12:54:25,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {1227#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1227#false} is VALID [2018-11-23 12:54:25,387 INFO L256 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1226#true} is VALID [2018-11-23 12:54:25,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {1226#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1226#true} is VALID [2018-11-23 12:54:25,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:54:25,388 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1226#true} {1227#false} #62#return; {1227#false} is VALID [2018-11-23 12:54:25,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {1227#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1227#false} is VALID [2018-11-23 12:54:25,389 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#false} assume 0 == #t~ret12;havoc #t~ret12; {1227#false} is VALID [2018-11-23 12:54:25,389 INFO L273 TraceCheckUtils]: 29: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 12:54:25,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:54:25,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:25,391 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:25,409 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:25,438 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:54:25,438 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:25,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:25,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:25,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:25,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:25,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:25,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:25,656 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:25,656 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= (+ main_~i~0 9) .cse0) (<= .cse0 |main_#t~mem10|))) [2018-11-23 12:54:25,656 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 9) |main_#t~mem10|) [2018-11-23 12:54:25,703 INFO L256 TraceCheckUtils]: 0: Hoare triple {1226#true} call ULTIMATE.init(); {1226#true} is VALID [2018-11-23 12:54:25,703 INFO L273 TraceCheckUtils]: 1: Hoare triple {1226#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1226#true} is VALID [2018-11-23 12:54:25,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {1226#true} assume true; {1226#true} is VALID [2018-11-23 12:54:25,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1226#true} {1226#true} #58#return; {1226#true} is VALID [2018-11-23 12:54:25,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {1226#true} call #t~ret13 := main(); {1226#true} is VALID [2018-11-23 12:54:25,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {1226#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1226#true} is VALID [2018-11-23 12:54:25,704 INFO L273 TraceCheckUtils]: 6: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:25,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:25,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:25,705 INFO L273 TraceCheckUtils]: 9: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:25,705 INFO L273 TraceCheckUtils]: 10: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:25,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:25,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:25,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:25,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {1226#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1226#true} is VALID [2018-11-23 12:54:25,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {1226#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1226#true} is VALID [2018-11-23 12:54:25,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {1226#true} assume !(~j~0 < 10); {1226#true} is VALID [2018-11-23 12:54:25,709 INFO L273 TraceCheckUtils]: 17: Hoare triple {1226#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1288#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:25,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {1288#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:25,711 INFO L273 TraceCheckUtils]: 19: Hoare triple {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:25,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {1292#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1299#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:25,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {1299#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1303#(<= (+ main_~i~0 9) |main_#t~mem10|)} is VALID [2018-11-23 12:54:25,715 INFO L273 TraceCheckUtils]: 22: Hoare triple {1303#(<= (+ main_~i~0 9) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1227#false} is VALID [2018-11-23 12:54:25,715 INFO L256 TraceCheckUtils]: 23: Hoare triple {1227#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1227#false} is VALID [2018-11-23 12:54:25,715 INFO L273 TraceCheckUtils]: 24: Hoare triple {1227#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1227#false} is VALID [2018-11-23 12:54:25,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {1227#false} assume true; {1227#false} is VALID [2018-11-23 12:54:25,716 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1227#false} {1227#false} #62#return; {1227#false} is VALID [2018-11-23 12:54:25,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {1227#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1227#false} is VALID [2018-11-23 12:54:25,717 INFO L273 TraceCheckUtils]: 28: Hoare triple {1227#false} assume 0 == #t~ret12;havoc #t~ret12; {1227#false} is VALID [2018-11-23 12:54:25,717 INFO L273 TraceCheckUtils]: 29: Hoare triple {1227#false} assume !false; {1227#false} is VALID [2018-11-23 12:54:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-23 12:54:25,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:25,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2018-11-23 12:54:25,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 12:54:25,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:25,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:54:25,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:25,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:54:25,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:54:25,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:25,898 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-23 12:54:26,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,357 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-11-23 12:54:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:54:26,357 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-23 12:54:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:26,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2018-11-23 12:54:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 51 transitions. [2018-11-23 12:54:26,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 51 transitions. [2018-11-23 12:54:26,438 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:26,439 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:54:26,439 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:54:26,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:54:26,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:54:26,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 12:54:26,476 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,476 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:26,476 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:26,477 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,479 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:26,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:26,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,480 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:26,480 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,485 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:26,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:54:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 12:54:26,488 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-11-23 12:54:26,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,488 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 12:54:26,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:54:26,488 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:54:26,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:54:26,489 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,489 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1119042125, now seen corresponding path program 4 times [2018-11-23 12:54:26,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:26,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1527#true} is VALID [2018-11-23 12:54:26,867 INFO L273 TraceCheckUtils]: 1: Hoare triple {1527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1527#true} is VALID [2018-11-23 12:54:26,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2018-11-23 12:54:26,868 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #58#return; {1527#true} is VALID [2018-11-23 12:54:26,868 INFO L256 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret13 := main(); {1527#true} is VALID [2018-11-23 12:54:26,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {1527#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1529#(= main_~j~0 0)} is VALID [2018-11-23 12:54:26,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {1529#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1529#(= main_~j~0 0)} is VALID [2018-11-23 12:54:26,870 INFO L273 TraceCheckUtils]: 7: Hoare triple {1529#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1530#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {1530#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1530#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {1530#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1531#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,872 INFO L273 TraceCheckUtils]: 10: Hoare triple {1531#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1531#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,873 INFO L273 TraceCheckUtils]: 11: Hoare triple {1531#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1532#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:26,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {1532#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1532#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:26,876 INFO L273 TraceCheckUtils]: 13: Hoare triple {1532#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1533#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:26,877 INFO L273 TraceCheckUtils]: 14: Hoare triple {1533#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1533#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:26,878 INFO L273 TraceCheckUtils]: 15: Hoare triple {1533#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1534#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:26,878 INFO L273 TraceCheckUtils]: 16: Hoare triple {1534#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1534#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:26,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {1534#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1535#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:26,880 INFO L273 TraceCheckUtils]: 18: Hoare triple {1535#(<= main_~j~0 6)} assume !(~j~0 < 10); {1528#false} is VALID [2018-11-23 12:54:26,880 INFO L273 TraceCheckUtils]: 19: Hoare triple {1528#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1528#false} is VALID [2018-11-23 12:54:26,881 INFO L273 TraceCheckUtils]: 20: Hoare triple {1528#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1528#false} is VALID [2018-11-23 12:54:26,881 INFO L273 TraceCheckUtils]: 21: Hoare triple {1528#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1528#false} is VALID [2018-11-23 12:54:26,881 INFO L273 TraceCheckUtils]: 22: Hoare triple {1528#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1528#false} is VALID [2018-11-23 12:54:26,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {1528#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1528#false} is VALID [2018-11-23 12:54:26,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {1528#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1528#false} is VALID [2018-11-23 12:54:26,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {1528#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1528#false} is VALID [2018-11-23 12:54:26,883 INFO L273 TraceCheckUtils]: 26: Hoare triple {1528#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1528#false} is VALID [2018-11-23 12:54:26,883 INFO L256 TraceCheckUtils]: 27: Hoare triple {1528#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1527#true} is VALID [2018-11-23 12:54:26,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {1527#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1527#true} is VALID [2018-11-23 12:54:26,884 INFO L273 TraceCheckUtils]: 29: Hoare triple {1527#true} assume true; {1527#true} is VALID [2018-11-23 12:54:26,884 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1527#true} {1528#false} #62#return; {1528#false} is VALID [2018-11-23 12:54:26,884 INFO L273 TraceCheckUtils]: 31: Hoare triple {1528#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1528#false} is VALID [2018-11-23 12:54:26,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {1528#false} assume 0 == #t~ret12;havoc #t~ret12; {1528#false} is VALID [2018-11-23 12:54:26,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2018-11-23 12:54:26,886 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:54:26,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:26,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:26,917 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:54:26,941 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:54:26,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:27,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:27,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:27,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:27,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:27,144 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:27,144 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:27,146 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:27,147 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= .cse0 |main_#t~mem10|) (<= (+ main_~i~0 8) .cse0))) [2018-11-23 12:54:27,147 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 8) |main_#t~mem10|) [2018-11-23 12:54:27,167 INFO L256 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1527#true} is VALID [2018-11-23 12:54:27,167 INFO L273 TraceCheckUtils]: 1: Hoare triple {1527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1527#true} is VALID [2018-11-23 12:54:27,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2018-11-23 12:54:27,168 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #58#return; {1527#true} is VALID [2018-11-23 12:54:27,168 INFO L256 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret13 := main(); {1527#true} is VALID [2018-11-23 12:54:27,169 INFO L273 TraceCheckUtils]: 5: Hoare triple {1527#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1527#true} is VALID [2018-11-23 12:54:27,169 INFO L273 TraceCheckUtils]: 6: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:27,169 INFO L273 TraceCheckUtils]: 7: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:27,170 INFO L273 TraceCheckUtils]: 8: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:27,170 INFO L273 TraceCheckUtils]: 9: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:27,170 INFO L273 TraceCheckUtils]: 10: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:27,170 INFO L273 TraceCheckUtils]: 11: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:27,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:27,171 INFO L273 TraceCheckUtils]: 13: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:27,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:27,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:27,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {1527#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1527#true} is VALID [2018-11-23 12:54:27,171 INFO L273 TraceCheckUtils]: 17: Hoare triple {1527#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1527#true} is VALID [2018-11-23 12:54:27,172 INFO L273 TraceCheckUtils]: 18: Hoare triple {1527#true} assume !(~j~0 < 10); {1527#true} is VALID [2018-11-23 12:54:27,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {1527#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1596#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:27,178 INFO L273 TraceCheckUtils]: 20: Hoare triple {1596#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:27,178 INFO L273 TraceCheckUtils]: 21: Hoare triple {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:27,179 INFO L273 TraceCheckUtils]: 22: Hoare triple {1600#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:27,179 INFO L273 TraceCheckUtils]: 23: Hoare triple {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:27,180 INFO L273 TraceCheckUtils]: 24: Hoare triple {1607#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1614#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:27,180 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1618#(<= (+ main_~i~0 8) |main_#t~mem10|)} is VALID [2018-11-23 12:54:27,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {1618#(<= (+ main_~i~0 8) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1528#false} is VALID [2018-11-23 12:54:27,181 INFO L256 TraceCheckUtils]: 27: Hoare triple {1528#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1528#false} is VALID [2018-11-23 12:54:27,181 INFO L273 TraceCheckUtils]: 28: Hoare triple {1528#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1528#false} is VALID [2018-11-23 12:54:27,181 INFO L273 TraceCheckUtils]: 29: Hoare triple {1528#false} assume true; {1528#false} is VALID [2018-11-23 12:54:27,181 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1528#false} {1528#false} #62#return; {1528#false} is VALID [2018-11-23 12:54:27,181 INFO L273 TraceCheckUtils]: 31: Hoare triple {1528#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1528#false} is VALID [2018-11-23 12:54:27,182 INFO L273 TraceCheckUtils]: 32: Hoare triple {1528#false} assume 0 == #t~ret12;havoc #t~ret12; {1528#false} is VALID [2018-11-23 12:54:27,182 INFO L273 TraceCheckUtils]: 33: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2018-11-23 12:54:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-23 12:54:27,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:27,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2018-11-23 12:54:27,203 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 12:54:27,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:27,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:54:27,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:27,480 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:54:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:54:27,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:54:27,481 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 14 states. [2018-11-23 12:54:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,331 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-11-23 12:54:28,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:54:28,334 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-23 12:54:28,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:28,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2018-11-23 12:54:28,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:28,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2018-11-23 12:54:28,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2018-11-23 12:54:28,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:28,475 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:54:28,475 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:54:28,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:54:28,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:54:28,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:54:28,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:28,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:28,496 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:28,497 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,499 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:54:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:54:28,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:28,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:28,500 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:54:28,500 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:54:28,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,502 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:54:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:54:28,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:28,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:28,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:28,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:28,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:54:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:54:28,505 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-11-23 12:54:28,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:28,505 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:54:28,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:54:28,506 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:54:28,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:28,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:28,507 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:28,507 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:28,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 5 times [2018-11-23 12:54:28,508 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:28,508 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:28,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:28,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:28,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {1867#true} call ULTIMATE.init(); {1867#true} is VALID [2018-11-23 12:54:28,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {1867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1867#true} is VALID [2018-11-23 12:54:28,714 INFO L273 TraceCheckUtils]: 2: Hoare triple {1867#true} assume true; {1867#true} is VALID [2018-11-23 12:54:28,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1867#true} {1867#true} #58#return; {1867#true} is VALID [2018-11-23 12:54:28,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {1867#true} call #t~ret13 := main(); {1867#true} is VALID [2018-11-23 12:54:28,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {1867#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1869#(= main_~j~0 0)} is VALID [2018-11-23 12:54:28,716 INFO L273 TraceCheckUtils]: 6: Hoare triple {1869#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1869#(= main_~j~0 0)} is VALID [2018-11-23 12:54:28,716 INFO L273 TraceCheckUtils]: 7: Hoare triple {1869#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {1870#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {1870#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,726 INFO L273 TraceCheckUtils]: 10: Hoare triple {1871#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,726 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,727 INFO L273 TraceCheckUtils]: 12: Hoare triple {1872#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,727 INFO L273 TraceCheckUtils]: 13: Hoare triple {1872#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {1873#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,728 INFO L273 TraceCheckUtils]: 15: Hoare triple {1873#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:28,728 INFO L273 TraceCheckUtils]: 16: Hoare triple {1874#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:28,729 INFO L273 TraceCheckUtils]: 17: Hoare triple {1874#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:28,729 INFO L273 TraceCheckUtils]: 18: Hoare triple {1875#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:28,730 INFO L273 TraceCheckUtils]: 19: Hoare triple {1875#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1876#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:28,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#(<= main_~j~0 7)} assume !(~j~0 < 10); {1868#false} is VALID [2018-11-23 12:54:28,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {1868#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1868#false} is VALID [2018-11-23 12:54:28,732 INFO L273 TraceCheckUtils]: 22: Hoare triple {1868#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1868#false} is VALID [2018-11-23 12:54:28,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:28,732 INFO L273 TraceCheckUtils]: 24: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:28,732 INFO L273 TraceCheckUtils]: 25: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:28,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:28,733 INFO L273 TraceCheckUtils]: 27: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:28,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:28,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:28,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {1868#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1868#false} is VALID [2018-11-23 12:54:28,734 INFO L256 TraceCheckUtils]: 31: Hoare triple {1868#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1867#true} is VALID [2018-11-23 12:54:28,734 INFO L273 TraceCheckUtils]: 32: Hoare triple {1867#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1867#true} is VALID [2018-11-23 12:54:28,734 INFO L273 TraceCheckUtils]: 33: Hoare triple {1867#true} assume true; {1867#true} is VALID [2018-11-23 12:54:28,735 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1867#true} {1868#false} #62#return; {1868#false} is VALID [2018-11-23 12:54:28,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {1868#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1868#false} is VALID [2018-11-23 12:54:28,735 INFO L273 TraceCheckUtils]: 36: Hoare triple {1868#false} assume 0 == #t~ret12;havoc #t~ret12; {1868#false} is VALID [2018-11-23 12:54:28,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {1868#false} assume !false; {1868#false} is VALID [2018-11-23 12:54:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:28,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:28,737 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:28,753 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:54:32,812 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-11-23 12:54:32,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:32,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:32,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {1867#true} call ULTIMATE.init(); {1867#true} is VALID [2018-11-23 12:54:32,933 INFO L273 TraceCheckUtils]: 1: Hoare triple {1867#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1867#true} is VALID [2018-11-23 12:54:32,933 INFO L273 TraceCheckUtils]: 2: Hoare triple {1867#true} assume true; {1867#true} is VALID [2018-11-23 12:54:32,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1867#true} {1867#true} #58#return; {1867#true} is VALID [2018-11-23 12:54:32,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {1867#true} call #t~ret13 := main(); {1867#true} is VALID [2018-11-23 12:54:32,935 INFO L273 TraceCheckUtils]: 5: Hoare triple {1867#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {1895#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:32,935 INFO L273 TraceCheckUtils]: 6: Hoare triple {1895#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1895#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:32,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {1895#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,936 INFO L273 TraceCheckUtils]: 8: Hoare triple {1870#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1870#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,937 INFO L273 TraceCheckUtils]: 9: Hoare triple {1870#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {1871#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1871#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {1871#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {1872#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1872#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {1872#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {1873#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1873#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {1873#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {1874#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1874#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {1874#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {1875#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {1875#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {1875#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {1876#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:32,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {1876#(<= main_~j~0 7)} assume !(~j~0 < 10); {1868#false} is VALID [2018-11-23 12:54:32,944 INFO L273 TraceCheckUtils]: 21: Hoare triple {1868#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {1868#false} is VALID [2018-11-23 12:54:32,944 INFO L273 TraceCheckUtils]: 22: Hoare triple {1868#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {1868#false} is VALID [2018-11-23 12:54:32,944 INFO L273 TraceCheckUtils]: 23: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:32,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:32,945 INFO L273 TraceCheckUtils]: 25: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:32,945 INFO L273 TraceCheckUtils]: 26: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:32,945 INFO L273 TraceCheckUtils]: 27: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:32,946 INFO L273 TraceCheckUtils]: 28: Hoare triple {1868#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {1868#false} is VALID [2018-11-23 12:54:32,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {1868#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {1868#false} is VALID [2018-11-23 12:54:32,946 INFO L273 TraceCheckUtils]: 30: Hoare triple {1868#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {1868#false} is VALID [2018-11-23 12:54:32,946 INFO L256 TraceCheckUtils]: 31: Hoare triple {1868#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1868#false} is VALID [2018-11-23 12:54:32,946 INFO L273 TraceCheckUtils]: 32: Hoare triple {1868#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {1868#false} is VALID [2018-11-23 12:54:32,947 INFO L273 TraceCheckUtils]: 33: Hoare triple {1868#false} assume true; {1868#false} is VALID [2018-11-23 12:54:32,947 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {1868#false} {1868#false} #62#return; {1868#false} is VALID [2018-11-23 12:54:32,947 INFO L273 TraceCheckUtils]: 35: Hoare triple {1868#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {1868#false} is VALID [2018-11-23 12:54:32,948 INFO L273 TraceCheckUtils]: 36: Hoare triple {1868#false} assume 0 == #t~ret12;havoc #t~ret12; {1868#false} is VALID [2018-11-23 12:54:32,948 INFO L273 TraceCheckUtils]: 37: Hoare triple {1868#false} assume !false; {1868#false} is VALID [2018-11-23 12:54:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:32,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:32,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:54:32,971 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 12:54:32,972 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:32,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:54:33,013 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:33,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:54:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:54:33,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:33,014 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-11-23 12:54:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,358 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:54:33,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:54:33,358 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-11-23 12:54:33,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:33,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:33,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:33,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-23 12:54:33,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:33,429 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:54:33,429 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:54:33,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:33,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:54:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 12:54:33,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:33,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:33,496 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:33,496 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:33,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,499 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:54:33,499 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:54:33,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:33,500 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 12:54:33,501 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 12:54:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:33,502 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:54:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:54:33,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:33,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:33,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:33,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:33,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:54:33,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 12:54:33,505 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-23 12:54:33,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:33,505 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 12:54:33,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:54:33,505 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:54:33,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:54:33,506 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:33,506 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:33,506 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:33,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:33,507 INFO L82 PathProgramCache]: Analyzing trace with hash 478163660, now seen corresponding path program 6 times [2018-11-23 12:54:33,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:33,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:33,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:33,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:33,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:33,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-23 12:54:33,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2223#true} is VALID [2018-11-23 12:54:33,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-23 12:54:33,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #58#return; {2223#true} is VALID [2018-11-23 12:54:33,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret13 := main(); {2223#true} is VALID [2018-11-23 12:54:33,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {2225#(= main_~j~0 0)} is VALID [2018-11-23 12:54:33,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {2225#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2225#(= main_~j~0 0)} is VALID [2018-11-23 12:54:33,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {2225#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2226#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:33,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {2226#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2226#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:33,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {2226#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2227#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:33,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {2227#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2227#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:33,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {2227#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2228#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:33,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {2228#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2228#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:33,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {2228#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2229#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:33,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {2229#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2229#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:33,832 INFO L273 TraceCheckUtils]: 15: Hoare triple {2229#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2230#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:33,837 INFO L273 TraceCheckUtils]: 16: Hoare triple {2230#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2230#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:33,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {2230#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2231#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:33,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {2231#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2231#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:33,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {2231#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2232#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:33,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {2232#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2232#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:33,847 INFO L273 TraceCheckUtils]: 21: Hoare triple {2232#(<= main_~j~0 7)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2233#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:33,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {2233#(<= main_~j~0 8)} assume !(~j~0 < 10); {2224#false} is VALID [2018-11-23 12:54:33,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {2224#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {2224#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 26: Hoare triple {2224#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {2224#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 29: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:33,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {2224#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2224#false} is VALID [2018-11-23 12:54:33,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {2224#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2224#false} is VALID [2018-11-23 12:54:33,849 INFO L273 TraceCheckUtils]: 32: Hoare triple {2224#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {2224#false} is VALID [2018-11-23 12:54:33,849 INFO L256 TraceCheckUtils]: 33: Hoare triple {2224#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2223#true} is VALID [2018-11-23 12:54:33,849 INFO L273 TraceCheckUtils]: 34: Hoare triple {2223#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {2223#true} is VALID [2018-11-23 12:54:33,849 INFO L273 TraceCheckUtils]: 35: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-23 12:54:33,849 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2223#true} {2224#false} #62#return; {2224#false} is VALID [2018-11-23 12:54:33,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {2224#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2224#false} is VALID [2018-11-23 12:54:33,850 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} assume 0 == #t~ret12;havoc #t~ret12; {2224#false} is VALID [2018-11-23 12:54:33,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-23 12:54:33,851 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-23 12:54:33,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:33,851 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:33,863 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:54:34,712 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:54:34,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:34,761 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:35,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:35,237 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:35,242 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:35,244 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:35,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:35,246 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:35,249 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:35,249 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= .cse0 |main_#t~mem10|) (<= (+ main_~i~0 7) .cse0))) [2018-11-23 12:54:35,249 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 7) |main_#t~mem10|) [2018-11-23 12:54:35,269 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-23 12:54:35,270 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2223#true} is VALID [2018-11-23 12:54:35,270 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-23 12:54:35,270 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #58#return; {2223#true} is VALID [2018-11-23 12:54:35,270 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret13 := main(); {2223#true} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {2223#true} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 12: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 13: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,273 INFO L273 TraceCheckUtils]: 14: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,273 INFO L273 TraceCheckUtils]: 15: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,273 INFO L273 TraceCheckUtils]: 16: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,273 INFO L273 TraceCheckUtils]: 17: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,273 INFO L273 TraceCheckUtils]: 18: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,273 INFO L273 TraceCheckUtils]: 19: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,274 INFO L273 TraceCheckUtils]: 20: Hoare triple {2223#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2223#true} is VALID [2018-11-23 12:54:35,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {2223#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2223#true} is VALID [2018-11-23 12:54:35,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {2223#true} assume !(~j~0 < 10); {2223#true} is VALID [2018-11-23 12:54:35,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {2223#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {2306#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:35,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {2306#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {2310#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,276 INFO L273 TraceCheckUtils]: 25: Hoare triple {2310#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2310#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,277 INFO L273 TraceCheckUtils]: 26: Hoare triple {2310#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2317#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {2317#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2317#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {2317#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2324#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {2324#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2324#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,279 INFO L273 TraceCheckUtils]: 30: Hoare triple {2324#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2331#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:35,280 INFO L273 TraceCheckUtils]: 31: Hoare triple {2331#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2335#(<= (+ main_~i~0 7) |main_#t~mem10|)} is VALID [2018-11-23 12:54:35,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {2335#(<= (+ main_~i~0 7) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {2224#false} is VALID [2018-11-23 12:54:35,281 INFO L256 TraceCheckUtils]: 33: Hoare triple {2224#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2224#false} is VALID [2018-11-23 12:54:35,281 INFO L273 TraceCheckUtils]: 34: Hoare triple {2224#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {2224#false} is VALID [2018-11-23 12:54:35,281 INFO L273 TraceCheckUtils]: 35: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-23 12:54:35,282 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {2224#false} {2224#false} #62#return; {2224#false} is VALID [2018-11-23 12:54:35,282 INFO L273 TraceCheckUtils]: 37: Hoare triple {2224#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2224#false} is VALID [2018-11-23 12:54:35,282 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} assume 0 == #t~ret12;havoc #t~ret12; {2224#false} is VALID [2018-11-23 12:54:35,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-23 12:54:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-11-23 12:54:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2018-11-23 12:54:35,306 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 12:54:35,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:35,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:54:35,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:35,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:54:35,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:54:35,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:54:35,367 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 17 states. [2018-11-23 12:54:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,055 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-11-23 12:54:36,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:54:36,055 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-11-23 12:54:36,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:36,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:54:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 61 transitions. [2018-11-23 12:54:36,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:54:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 61 transitions. [2018-11-23 12:54:36,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 61 transitions. [2018-11-23 12:54:36,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:36,163 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:54:36,163 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:54:36,164 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:54:36,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:54:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 12:54:36,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:36,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 12:54:36,225 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 12:54:36,225 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 12:54:36,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,226 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:54:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:54:36,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:36,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:36,227 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 12:54:36,227 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 12:54:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,228 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:54:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:54:36,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:36,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:36,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:36,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:54:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:54:36,230 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 40 [2018-11-23 12:54:36,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:36,230 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:54:36,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:54:36,230 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:54:36,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:54:36,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:36,231 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:36,231 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:36,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash -956118231, now seen corresponding path program 7 times [2018-11-23 12:54:36,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:36,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:36,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:36,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {2619#true} call ULTIMATE.init(); {2619#true} is VALID [2018-11-23 12:54:36,554 INFO L273 TraceCheckUtils]: 1: Hoare triple {2619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2619#true} is VALID [2018-11-23 12:54:36,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 12:54:36,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2619#true} {2619#true} #58#return; {2619#true} is VALID [2018-11-23 12:54:36,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {2619#true} call #t~ret13 := main(); {2619#true} is VALID [2018-11-23 12:54:36,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {2619#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {2621#(= main_~j~0 0)} is VALID [2018-11-23 12:54:36,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {2621#(= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2621#(= main_~j~0 0)} is VALID [2018-11-23 12:54:36,571 INFO L273 TraceCheckUtils]: 7: Hoare triple {2621#(= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2622#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:36,571 INFO L273 TraceCheckUtils]: 8: Hoare triple {2622#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2622#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:36,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {2622#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2623#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:36,573 INFO L273 TraceCheckUtils]: 10: Hoare triple {2623#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2623#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:36,573 INFO L273 TraceCheckUtils]: 11: Hoare triple {2623#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2624#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:36,574 INFO L273 TraceCheckUtils]: 12: Hoare triple {2624#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2624#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:36,574 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2625#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:36,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2625#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:36,576 INFO L273 TraceCheckUtils]: 15: Hoare triple {2625#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2626#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:36,576 INFO L273 TraceCheckUtils]: 16: Hoare triple {2626#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2626#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:36,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {2626#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2627#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:36,577 INFO L273 TraceCheckUtils]: 18: Hoare triple {2627#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2627#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:36,578 INFO L273 TraceCheckUtils]: 19: Hoare triple {2627#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2628#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:36,579 INFO L273 TraceCheckUtils]: 20: Hoare triple {2628#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2628#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:36,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {2628#(<= main_~j~0 7)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2629#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:36,580 INFO L273 TraceCheckUtils]: 22: Hoare triple {2629#(<= main_~j~0 8)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2629#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:36,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {2629#(<= main_~j~0 8)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2630#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:36,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {2630#(<= main_~j~0 9)} assume !(~j~0 < 10); {2620#false} is VALID [2018-11-23 12:54:36,582 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,582 INFO L273 TraceCheckUtils]: 26: Hoare triple {2620#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {2620#false} is VALID [2018-11-23 12:54:36,582 INFO L273 TraceCheckUtils]: 27: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,583 INFO L273 TraceCheckUtils]: 31: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,583 INFO L273 TraceCheckUtils]: 32: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,584 INFO L273 TraceCheckUtils]: 33: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,584 INFO L273 TraceCheckUtils]: 34: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,584 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,584 INFO L273 TraceCheckUtils]: 36: Hoare triple {2620#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {2620#false} is VALID [2018-11-23 12:54:36,584 INFO L256 TraceCheckUtils]: 37: Hoare triple {2620#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2619#true} is VALID [2018-11-23 12:54:36,585 INFO L273 TraceCheckUtils]: 38: Hoare triple {2619#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {2619#true} is VALID [2018-11-23 12:54:36,585 INFO L273 TraceCheckUtils]: 39: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 12:54:36,585 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2619#true} {2620#false} #62#return; {2620#false} is VALID [2018-11-23 12:54:36,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {2620#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2620#false} is VALID [2018-11-23 12:54:36,585 INFO L273 TraceCheckUtils]: 42: Hoare triple {2620#false} assume 0 == #t~ret12;havoc #t~ret12; {2620#false} is VALID [2018-11-23 12:54:36,585 INFO L273 TraceCheckUtils]: 43: Hoare triple {2620#false} assume !false; {2620#false} is VALID [2018-11-23 12:54:36,586 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 12:54:36,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:36,587 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:36,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:36,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:36,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {2619#true} call ULTIMATE.init(); {2619#true} is VALID [2018-11-23 12:54:36,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {2619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2619#true} is VALID [2018-11-23 12:54:36,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {2619#true} assume true; {2619#true} is VALID [2018-11-23 12:54:36,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2619#true} {2619#true} #58#return; {2619#true} is VALID [2018-11-23 12:54:36,785 INFO L256 TraceCheckUtils]: 4: Hoare triple {2619#true} call #t~ret13 := main(); {2619#true} is VALID [2018-11-23 12:54:36,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {2619#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {2649#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:36,787 INFO L273 TraceCheckUtils]: 6: Hoare triple {2649#(<= main_~j~0 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2649#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:36,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {2649#(<= main_~j~0 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2622#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:36,788 INFO L273 TraceCheckUtils]: 8: Hoare triple {2622#(<= main_~j~0 1)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2622#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:36,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {2622#(<= main_~j~0 1)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2623#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:36,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {2623#(<= main_~j~0 2)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2623#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:36,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {2623#(<= main_~j~0 2)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2624#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:36,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {2624#(<= main_~j~0 3)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2624#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:36,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {2624#(<= main_~j~0 3)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2625#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:36,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {2625#(<= main_~j~0 4)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2625#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:36,792 INFO L273 TraceCheckUtils]: 15: Hoare triple {2625#(<= main_~j~0 4)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2626#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:36,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {2626#(<= main_~j~0 5)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2626#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:36,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {2626#(<= main_~j~0 5)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2627#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:36,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {2627#(<= main_~j~0 6)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2627#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:36,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {2627#(<= main_~j~0 6)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2628#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:36,795 INFO L273 TraceCheckUtils]: 20: Hoare triple {2628#(<= main_~j~0 7)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2628#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:36,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {2628#(<= main_~j~0 7)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2629#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:36,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {2629#(<= main_~j~0 8)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {2629#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:36,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {2629#(<= main_~j~0 8)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {2630#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:36,798 INFO L273 TraceCheckUtils]: 24: Hoare triple {2630#(<= main_~j~0 9)} assume !(~j~0 < 10); {2620#false} is VALID [2018-11-23 12:54:36,798 INFO L273 TraceCheckUtils]: 25: Hoare triple {2620#false} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,799 INFO L273 TraceCheckUtils]: 26: Hoare triple {2620#false} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {2620#false} is VALID [2018-11-23 12:54:36,799 INFO L273 TraceCheckUtils]: 27: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,799 INFO L273 TraceCheckUtils]: 29: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,800 INFO L273 TraceCheckUtils]: 30: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,800 INFO L273 TraceCheckUtils]: 31: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,800 INFO L273 TraceCheckUtils]: 32: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,800 INFO L273 TraceCheckUtils]: 33: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,800 INFO L273 TraceCheckUtils]: 34: Hoare triple {2620#false} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {2620#false} is VALID [2018-11-23 12:54:36,801 INFO L273 TraceCheckUtils]: 35: Hoare triple {2620#false} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {2620#false} is VALID [2018-11-23 12:54:36,801 INFO L273 TraceCheckUtils]: 36: Hoare triple {2620#false} assume !(~i~0 < #t~mem10);havoc #t~mem10; {2620#false} is VALID [2018-11-23 12:54:36,801 INFO L256 TraceCheckUtils]: 37: Hoare triple {2620#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {2620#false} is VALID [2018-11-23 12:54:36,801 INFO L273 TraceCheckUtils]: 38: Hoare triple {2620#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {2620#false} is VALID [2018-11-23 12:54:36,802 INFO L273 TraceCheckUtils]: 39: Hoare triple {2620#false} assume true; {2620#false} is VALID [2018-11-23 12:54:36,802 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {2620#false} {2620#false} #62#return; {2620#false} is VALID [2018-11-23 12:54:36,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {2620#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {2620#false} is VALID [2018-11-23 12:54:36,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {2620#false} assume 0 == #t~ret12;havoc #t~ret12; {2620#false} is VALID [2018-11-23 12:54:36,802 INFO L273 TraceCheckUtils]: 43: Hoare triple {2620#false} assume !false; {2620#false} is VALID [2018-11-23 12:54:36,804 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-23 12:54:36,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:36,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:54:36,824 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 12:54:36,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:36,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:54:36,898 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:36,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:54:36,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:54:36,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:54:36,899 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 13 states. [2018-11-23 12:54:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,172 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 12:54:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:54:37,173 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-11-23 12:54:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:37,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:54:37,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-23 12:54:37,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:54:37,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 53 transitions. [2018-11-23 12:54:37,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 53 transitions. [2018-11-23 12:54:37,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:37,241 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:54:37,241 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:54:37,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:54:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:54:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 12:54:37,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:37,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:37,363 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:37,363 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,364 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:54:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:37,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:37,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:37,365 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:37,365 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:54:37,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,366 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:54:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:37,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:37,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:37,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:37,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:54:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 12:54:37,367 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-11-23 12:54:37,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:37,368 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 12:54:37,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:54:37,368 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:54:37,368 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:37,368 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:37,369 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:37,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash -50051957, now seen corresponding path program 8 times [2018-11-23 12:54:37,369 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:37,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:38,799 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 3 [2018-11-23 12:54:41,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {3025#true} call ULTIMATE.init(); {3025#true} is VALID [2018-11-23 12:54:41,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {3025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3025#true} is VALID [2018-11-23 12:54:41,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 12:54:41,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3025#true} {3025#true} #58#return; {3025#true} is VALID [2018-11-23 12:54:41,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {3025#true} call #t~ret13 := main(); {3025#true} is VALID [2018-11-23 12:54:41,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {3025#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:41,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3028#(or (= |main_~#array~0.offset| 0) (= main_~i~0 main_~j~0))} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 18: Hoare triple {3028#(or (= |main_~#array~0.offset| 0) (= main_~i~0 main_~j~0))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3028#(or (= |main_~#array~0.offset| 0) (= main_~i~0 main_~j~0))} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {3028#(or (= |main_~#array~0.offset| 0) (= main_~i~0 main_~j~0))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3025#true} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {3025#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3025#true} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {3025#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3025#true} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {3025#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3025#true} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {3025#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3025#true} is VALID [2018-11-23 12:54:41,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {3025#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3025#true} is VALID [2018-11-23 12:54:41,054 INFO L273 TraceCheckUtils]: 25: Hoare triple {3025#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3025#true} is VALID [2018-11-23 12:54:41,054 INFO L273 TraceCheckUtils]: 26: Hoare triple {3025#true} assume !(~j~0 < 10); {3025#true} is VALID [2018-11-23 12:54:41,055 INFO L273 TraceCheckUtils]: 27: Hoare triple {3025#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {3029#(and (= |main_#t~mem8| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 8 main_~i~0) 4))))} is VALID [2018-11-23 12:54:41,056 INFO L273 TraceCheckUtils]: 28: Hoare triple {3029#(and (= |main_#t~mem8| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 8 main_~i~0) 4))))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {3030#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,058 INFO L273 TraceCheckUtils]: 29: Hoare triple {3030#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3031#(and (<= (+ main_~i~0 10) |main_#t~mem10|) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 12:54:41,060 INFO L273 TraceCheckUtils]: 30: Hoare triple {3031#(and (<= (+ main_~i~0 10) |main_#t~mem10|) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3032#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {3032#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3032#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {3032#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3033#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {3033#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3033#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,064 INFO L273 TraceCheckUtils]: 34: Hoare triple {3033#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3034#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,064 INFO L273 TraceCheckUtils]: 35: Hoare triple {3034#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3034#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,066 INFO L273 TraceCheckUtils]: 36: Hoare triple {3034#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3035#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:41,066 INFO L273 TraceCheckUtils]: 37: Hoare triple {3035#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3036#(<= (+ main_~i~0 6) |main_#t~mem10|)} is VALID [2018-11-23 12:54:41,068 INFO L273 TraceCheckUtils]: 38: Hoare triple {3036#(<= (+ main_~i~0 6) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {3026#false} is VALID [2018-11-23 12:54:41,068 INFO L256 TraceCheckUtils]: 39: Hoare triple {3026#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {3025#true} is VALID [2018-11-23 12:54:41,068 INFO L273 TraceCheckUtils]: 40: Hoare triple {3025#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {3025#true} is VALID [2018-11-23 12:54:41,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 12:54:41,068 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3025#true} {3026#false} #62#return; {3026#false} is VALID [2018-11-23 12:54:41,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {3026#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3026#false} is VALID [2018-11-23 12:54:41,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {3026#false} assume 0 == #t~ret12;havoc #t~ret12; {3026#false} is VALID [2018-11-23 12:54:41,069 INFO L273 TraceCheckUtils]: 45: Hoare triple {3026#false} assume !false; {3026#false} is VALID [2018-11-23 12:54:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2018-11-23 12:54:41,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:41,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:41,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:41,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:41,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:41,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:41,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-11-23 12:54:41,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-23 12:54:41,973 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:41,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:41,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:41,977 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2018-11-23 12:54:41,980 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:41,980 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_22]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))) (and (<= (+ main_~i~0 6) .cse0) (<= .cse0 |main_#t~mem10|))) [2018-11-23 12:54:41,980 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 6) |main_#t~mem10|) [2018-11-23 12:54:41,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {3025#true} call ULTIMATE.init(); {3025#true} is VALID [2018-11-23 12:54:41,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {3025#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3025#true} is VALID [2018-11-23 12:54:41,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {3025#true} assume true; {3025#true} is VALID [2018-11-23 12:54:41,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3025#true} {3025#true} #58#return; {3025#true} is VALID [2018-11-23 12:54:41,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {3025#true} call #t~ret13 := main(); {3025#true} is VALID [2018-11-23 12:54:41,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {3025#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {3055#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 0))} is VALID [2018-11-23 12:54:41,992 INFO L273 TraceCheckUtils]: 6: Hoare triple {3055#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 0))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3055#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 0))} is VALID [2018-11-23 12:54:41,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {3055#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 0))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3062#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 1))} is VALID [2018-11-23 12:54:41,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {3062#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 1))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3062#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 1))} is VALID [2018-11-23 12:54:41,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {3062#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 1))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3069#(and (= main_~j~0 2) (= 0 |main_~#array~0.offset|))} is VALID [2018-11-23 12:54:41,995 INFO L273 TraceCheckUtils]: 10: Hoare triple {3069#(and (= main_~j~0 2) (= 0 |main_~#array~0.offset|))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3069#(and (= main_~j~0 2) (= 0 |main_~#array~0.offset|))} is VALID [2018-11-23 12:54:41,995 INFO L273 TraceCheckUtils]: 11: Hoare triple {3069#(and (= main_~j~0 2) (= 0 |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3076#(and (= main_~j~0 3) (= 0 |main_~#array~0.offset|))} is VALID [2018-11-23 12:54:41,997 INFO L273 TraceCheckUtils]: 12: Hoare triple {3076#(and (= main_~j~0 3) (= 0 |main_~#array~0.offset|))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3076#(and (= main_~j~0 3) (= 0 |main_~#array~0.offset|))} is VALID [2018-11-23 12:54:41,998 INFO L273 TraceCheckUtils]: 13: Hoare triple {3076#(and (= main_~j~0 3) (= 0 |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3083#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 4))} is VALID [2018-11-23 12:54:41,999 INFO L273 TraceCheckUtils]: 14: Hoare triple {3083#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 4))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3083#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 4))} is VALID [2018-11-23 12:54:42,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {3083#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 4))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3090#(and (= main_~j~0 5) (= 0 |main_~#array~0.offset|))} is VALID [2018-11-23 12:54:42,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {3090#(and (= main_~j~0 5) (= 0 |main_~#array~0.offset|))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3090#(and (= main_~j~0 5) (= 0 |main_~#array~0.offset|))} is VALID [2018-11-23 12:54:42,002 INFO L273 TraceCheckUtils]: 17: Hoare triple {3090#(and (= main_~j~0 5) (= 0 |main_~#array~0.offset|))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3097#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 6))} is VALID [2018-11-23 12:54:42,003 INFO L273 TraceCheckUtils]: 18: Hoare triple {3097#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 6))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3097#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 6))} is VALID [2018-11-23 12:54:42,004 INFO L273 TraceCheckUtils]: 19: Hoare triple {3097#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 6))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3104#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 7))} is VALID [2018-11-23 12:54:42,005 INFO L273 TraceCheckUtils]: 20: Hoare triple {3104#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 7))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3104#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 7))} is VALID [2018-11-23 12:54:42,006 INFO L273 TraceCheckUtils]: 21: Hoare triple {3104#(and (= 0 |main_~#array~0.offset|) (= main_~j~0 7))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:42,006 INFO L273 TraceCheckUtils]: 22: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:42,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:42,007 INFO L273 TraceCheckUtils]: 24: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:42,008 INFO L273 TraceCheckUtils]: 25: Hoare triple {3027#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:42,009 INFO L273 TraceCheckUtils]: 26: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume !(~j~0 < 10); {3027#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:42,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {3027#(= |main_~#array~0.offset| 0)} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {3129#(and (= |main_~#array~0.offset| 0) (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:42,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {3129#(and (= |main_~#array~0.offset| 0) (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {3133#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,013 INFO L273 TraceCheckUtils]: 29: Hoare triple {3133#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3133#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,014 INFO L273 TraceCheckUtils]: 30: Hoare triple {3133#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3140#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,015 INFO L273 TraceCheckUtils]: 31: Hoare triple {3140#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3140#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,029 INFO L273 TraceCheckUtils]: 32: Hoare triple {3140#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3147#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,030 INFO L273 TraceCheckUtils]: 33: Hoare triple {3147#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3147#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {3147#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3154#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,031 INFO L273 TraceCheckUtils]: 35: Hoare triple {3154#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3154#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {3154#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3161#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} is VALID [2018-11-23 12:54:42,033 INFO L273 TraceCheckUtils]: 37: Hoare triple {3161#(exists ((v_main_~i~0_22 Int)) (and (= (+ (* 8 v_main_~i~0_22) 4) main_~pa~0.offset) (<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) (+ (* 8 v_main_~i~0_22) 4)))))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3036#(<= (+ main_~i~0 6) |main_#t~mem10|)} is VALID [2018-11-23 12:54:42,034 INFO L273 TraceCheckUtils]: 38: Hoare triple {3036#(<= (+ main_~i~0 6) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {3026#false} is VALID [2018-11-23 12:54:42,034 INFO L256 TraceCheckUtils]: 39: Hoare triple {3026#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {3026#false} is VALID [2018-11-23 12:54:42,035 INFO L273 TraceCheckUtils]: 40: Hoare triple {3026#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {3026#false} is VALID [2018-11-23 12:54:42,035 INFO L273 TraceCheckUtils]: 41: Hoare triple {3026#false} assume true; {3026#false} is VALID [2018-11-23 12:54:42,035 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3026#false} {3026#false} #62#return; {3026#false} is VALID [2018-11-23 12:54:42,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {3026#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3026#false} is VALID [2018-11-23 12:54:42,036 INFO L273 TraceCheckUtils]: 44: Hoare triple {3026#false} assume 0 == #t~ret12;havoc #t~ret12; {3026#false} is VALID [2018-11-23 12:54:42,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {3026#false} assume !false; {3026#false} is VALID [2018-11-23 12:54:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:54:42,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:42,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18] total 26 [2018-11-23 12:54:42,068 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-11-23 12:54:42,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:42,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:54:42,429 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:42,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:54:42,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:54:42,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=541, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:54:42,431 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 26 states. [2018-11-23 12:54:44,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,967 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:54:44,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:54:44,967 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 46 [2018-11-23 12:54:44,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:54:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 55 transitions. [2018-11-23 12:54:44,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:54:44,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 55 transitions. [2018-11-23 12:54:44,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 55 transitions. [2018-11-23 12:54:45,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:45,053 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:54:45,053 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:54:45,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=256, Invalid=1076, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:54:45,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:54:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 12:54:45,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:45,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 12:54:45,111 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:54:45,112 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:54:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,113 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:54:45,114 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:54:45,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:45,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:45,114 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:54:45,114 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:54:45,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:45,115 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:54:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:54:45,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:45,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:45,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:45,116 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:45,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:54:45,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 12:54:45,117 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-11-23 12:54:45,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:45,117 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 12:54:45,117 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:54:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:54:45,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:54:45,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:45,118 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:45,119 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:45,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:45,119 INFO L82 PathProgramCache]: Analyzing trace with hash -715849914, now seen corresponding path program 9 times [2018-11-23 12:54:45,119 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:45,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:45,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:45,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:46,030 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 3 [2018-11-23 12:54:48,188 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 23 [2018-11-23 12:54:49,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2018-11-23 12:54:49,118 INFO L273 TraceCheckUtils]: 1: Hoare triple {3465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3465#true} is VALID [2018-11-23 12:54:49,118 INFO L273 TraceCheckUtils]: 2: Hoare triple {3465#true} assume true; {3465#true} is VALID [2018-11-23 12:54:49,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3465#true} {3465#true} #58#return; {3465#true} is VALID [2018-11-23 12:54:49,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {3465#true} call #t~ret13 := main(); {3465#true} is VALID [2018-11-23 12:54:49,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {3465#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {3467#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {3467#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {3467#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,122 INFO L273 TraceCheckUtils]: 9: Hoare triple {3467#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {3467#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,123 INFO L273 TraceCheckUtils]: 11: Hoare triple {3467#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {3467#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,124 INFO L273 TraceCheckUtils]: 13: Hoare triple {3467#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {3467#(= |main_~#array~0.offset| 0)} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3467#(= |main_~#array~0.offset| 0)} is VALID [2018-11-23 12:54:49,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {3467#(= |main_~#array~0.offset| 0)} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3468#(or (= |main_~#array~0.offset| 0) (< main_~j~0 main_~i~0))} is VALID [2018-11-23 12:54:49,126 INFO L273 TraceCheckUtils]: 16: Hoare triple {3468#(or (= |main_~#array~0.offset| 0) (< main_~j~0 main_~i~0))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3468#(or (= |main_~#array~0.offset| 0) (< main_~j~0 main_~i~0))} is VALID [2018-11-23 12:54:49,127 INFO L273 TraceCheckUtils]: 17: Hoare triple {3468#(or (= |main_~#array~0.offset| 0) (< main_~j~0 main_~i~0))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3469#(or (= |main_~#array~0.offset| 0) (< main_~j~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:54:49,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {3469#(or (= |main_~#array~0.offset| 0) (< main_~j~0 (+ main_~i~0 1)))} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3469#(or (= |main_~#array~0.offset| 0) (< main_~j~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:54:49,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {3469#(or (= |main_~#array~0.offset| 0) (< main_~j~0 (+ main_~i~0 1)))} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:49,128 INFO L273 TraceCheckUtils]: 20: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:49,128 INFO L273 TraceCheckUtils]: 21: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:49,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:49,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:49,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:49,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:49,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {3465#true} assume !(~j~0 < 10); {3465#true} is VALID [2018-11-23 12:54:49,131 INFO L273 TraceCheckUtils]: 27: Hoare triple {3465#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {3470#(or (and (= |main_#t~mem8| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 8 main_~i~0) 4)))) (and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base)))} is VALID [2018-11-23 12:54:49,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {3470#(or (and (= |main_#t~mem8| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= |main_#t~mem8| (select (select |#memory_int| |main_~#array~0.base|) (+ |main_~#array~0.offset| (* 8 main_~i~0) 4)))) (and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base)))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {3471#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {3471#(= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3472#(and (= (+ main_~i~0 10) |main_#t~mem10|) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} is VALID [2018-11-23 12:54:49,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {3472#(and (= (+ main_~i~0 10) |main_#t~mem10|) (= |main_#t~mem10| (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3473#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,134 INFO L273 TraceCheckUtils]: 31: Hoare triple {3473#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3473#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {3473#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3474#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {3474#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3474#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {3474#(<= (+ main_~i~0 4) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3475#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {3475#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3475#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {3475#(<= (+ main_~i~0 3) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3476#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {3476#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3476#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {3476#(<= (+ main_~i~0 2) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3477#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:49,140 INFO L273 TraceCheckUtils]: 39: Hoare triple {3477#(<= (+ main_~i~0 1) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3478#(<= (+ main_~i~0 1) |main_#t~mem10|)} is VALID [2018-11-23 12:54:49,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {3478#(<= (+ main_~i~0 1) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {3466#false} is VALID [2018-11-23 12:54:49,141 INFO L256 TraceCheckUtils]: 41: Hoare triple {3466#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {3465#true} is VALID [2018-11-23 12:54:49,141 INFO L273 TraceCheckUtils]: 42: Hoare triple {3465#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {3465#true} is VALID [2018-11-23 12:54:49,142 INFO L273 TraceCheckUtils]: 43: Hoare triple {3465#true} assume true; {3465#true} is VALID [2018-11-23 12:54:49,142 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3465#true} {3466#false} #62#return; {3466#false} is VALID [2018-11-23 12:54:49,142 INFO L273 TraceCheckUtils]: 45: Hoare triple {3466#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3466#false} is VALID [2018-11-23 12:54:49,142 INFO L273 TraceCheckUtils]: 46: Hoare triple {3466#false} assume 0 == #t~ret12;havoc #t~ret12; {3466#false} is VALID [2018-11-23 12:54:49,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2018-11-23 12:54:49,146 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-11-23 12:54:49,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:49,146 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:49,156 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:49,809 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:54:49,809 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:49,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:49,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-23 12:54:49,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 12:54:49,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:49,939 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:49,943 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:49,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:12 [2018-11-23 12:54:49,948 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:49,948 WARN L384 uantifierElimination]: Input elimination task: ∃ [|main_~#cont~0.base|, |main_~#cont~0.offset|, |v_#memory_int_11|]. (and (= |#memory_int| (store |v_#memory_int_11| |main_~#cont~0.base| (store (select |v_#memory_int_11| |main_~#cont~0.base|) |main_~#cont~0.offset| (select (select |#memory_int| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base)) [2018-11-23 12:54:49,949 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base)) [2018-11-23 12:54:50,087 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 12:54:50,093 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-23 12:54:50,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:54:50,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:50,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:54:50,105 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2018-11-23 12:54:50,107 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:54:50,108 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, main_~pa~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))) (and (<= .cse0 |main_#t~mem10|) (<= (+ main_~i~0 5) .cse0))) [2018-11-23 12:54:50,108 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= (+ main_~i~0 5) |main_#t~mem10|) [2018-11-23 12:54:50,129 INFO L256 TraceCheckUtils]: 0: Hoare triple {3465#true} call ULTIMATE.init(); {3465#true} is VALID [2018-11-23 12:54:50,130 INFO L273 TraceCheckUtils]: 1: Hoare triple {3465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3465#true} is VALID [2018-11-23 12:54:50,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {3465#true} assume true; {3465#true} is VALID [2018-11-23 12:54:50,130 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3465#true} {3465#true} #58#return; {3465#true} is VALID [2018-11-23 12:54:50,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {3465#true} call #t~ret13 := main(); {3465#true} is VALID [2018-11-23 12:54:50,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {3465#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; {3465#true} is VALID [2018-11-23 12:54:50,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,131 INFO L273 TraceCheckUtils]: 8: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,131 INFO L273 TraceCheckUtils]: 9: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 10: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 12: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 13: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 20: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 21: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,133 INFO L273 TraceCheckUtils]: 24: Hoare triple {3465#true} assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; {3465#true} is VALID [2018-11-23 12:54:50,134 INFO L273 TraceCheckUtils]: 25: Hoare triple {3465#true} #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; {3465#true} is VALID [2018-11-23 12:54:50,134 INFO L273 TraceCheckUtils]: 26: Hoare triple {3465#true} assume !(~j~0 < 10); {3465#true} is VALID [2018-11-23 12:54:50,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {3465#true} assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); {3563#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} is VALID [2018-11-23 12:54:50,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {3563#(and (= (+ (* 8 main_~i~0) |main_~#array~0.offset| 4) main_~pa~0.offset) (= |main_~#array~0.base| main_~pa~0.base))} assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; {3567#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {3567#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3567#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {3567#(<= (+ main_~i~0 10) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3574#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,137 INFO L273 TraceCheckUtils]: 31: Hoare triple {3574#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3574#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,138 INFO L273 TraceCheckUtils]: 32: Hoare triple {3574#(<= (+ main_~i~0 9) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3581#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,138 INFO L273 TraceCheckUtils]: 33: Hoare triple {3581#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3581#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,139 INFO L273 TraceCheckUtils]: 34: Hoare triple {3581#(<= (+ main_~i~0 8) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3588#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,140 INFO L273 TraceCheckUtils]: 35: Hoare triple {3588#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3588#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,141 INFO L273 TraceCheckUtils]: 36: Hoare triple {3588#(<= (+ main_~i~0 7) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3595#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,141 INFO L273 TraceCheckUtils]: 37: Hoare triple {3595#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3595#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,158 INFO L273 TraceCheckUtils]: 38: Hoare triple {3595#(<= (+ main_~i~0 6) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; {3473#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} is VALID [2018-11-23 12:54:50,167 INFO L273 TraceCheckUtils]: 39: Hoare triple {3473#(<= (+ main_~i~0 5) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset))} call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); {3605#(<= (+ main_~i~0 5) |main_#t~mem10|)} is VALID [2018-11-23 12:54:50,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {3605#(<= (+ main_~i~0 5) |main_#t~mem10|)} assume !(~i~0 < #t~mem10);havoc #t~mem10; {3466#false} is VALID [2018-11-23 12:54:50,180 INFO L256 TraceCheckUtils]: 41: Hoare triple {3466#false} call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {3466#false} is VALID [2018-11-23 12:54:50,180 INFO L273 TraceCheckUtils]: 42: Hoare triple {3466#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; {3466#false} is VALID [2018-11-23 12:54:50,181 INFO L273 TraceCheckUtils]: 43: Hoare triple {3466#false} assume true; {3466#false} is VALID [2018-11-23 12:54:50,181 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {3466#false} {3466#false} #62#return; {3466#false} is VALID [2018-11-23 12:54:50,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {3466#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {3466#false} is VALID [2018-11-23 12:54:50,181 INFO L273 TraceCheckUtils]: 46: Hoare triple {3466#false} assume 0 == #t~ret12;havoc #t~ret12; {3466#false} is VALID [2018-11-23 12:54:50,181 INFO L273 TraceCheckUtils]: 47: Hoare triple {3466#false} assume !false; {3466#false} is VALID [2018-11-23 12:54:50,184 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-11-23 12:54:50,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:50,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2018-11-23 12:54:50,213 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-11-23 12:54:50,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:50,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:54:50,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:50,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:54:50,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:54:50,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:54:50,321 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 21 states. [2018-11-23 12:54:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:51,302 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-11-23 12:54:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:54:51,302 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 48 [2018-11-23 12:54:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:51,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:51,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 12:54:51,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 12:54:51,306 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 53 transitions. [2018-11-23 12:54:51,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:51,421 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:54:51,421 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:54:51,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=493, Invalid=1229, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:54:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:54:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 12:54:51,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:51,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:51,518 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:51,518 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:51,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:51,520 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:54:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:54:51,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:51,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:51,520 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:51,521 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:51,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:51,522 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:54:51,522 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:54:51,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:51,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:51,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:51,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:54:51,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 12:54:51,525 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 48 [2018-11-23 12:54:51,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:51,525 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 12:54:51,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:54:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:54:51,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:54:51,526 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:51,526 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:51,526 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:51,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:51,526 INFO L82 PathProgramCache]: Analyzing trace with hash -875693139, now seen corresponding path program 10 times [2018-11-23 12:54:51,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:51,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:51,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:51,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:51,866 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=111, |#NULL.offset|=107, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [main_~i~0=6, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7.base|=106, |main_#t~mem7.offset|=48, |main_#t~mem8|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~i~0 < #t~mem10);havoc #t~mem10; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume 0 == #t~ret12;havoc #t~ret12; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !false; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem8; [L32] havoc #t~mem7.base, #t~mem7.offset; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem8; [L32] havoc #t~mem7.base, #t~mem7.offset; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=6, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=6, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:48}, cont.array[0].b=1, i=6, j=10, pa={106:52}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-9, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=1, j=10, pa={106:52}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] ----- [2018-11-23 12:54:52,045 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:54:52,048 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:52,048 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:54:52,048 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:54:52,049 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2018-11-23 12:54:52,050 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L34-4 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:54:52,051 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:54:52,052 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2018-11-23 12:54:52,052 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 12:54:52,055 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:54:52 BoogieIcfgContainer [2018-11-23 12:54:52,055 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:54:52,056 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:54:52,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:54:52,057 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:54:52,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:54:18" (3/4) ... [2018-11-23 12:54:52,060 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=111, |#NULL.offset|=107, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=111, |old(#NULL.offset)|=107] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret13 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;~i~0 := #t~nondet2;havoc #t~nondet2;~j~0 := 0; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4);havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4);havoc #t~nondet5; VAL [main_~i~0=6, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] #t~post3 := ~j~0;~j~0 := 1 + #t~post3;havoc #t~post3; VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=6, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset;havoc #t~mem6.base, #t~mem6.offset;call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [main_~i~0=6, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem7.base|=106, |main_#t~mem7.offset|=48, |main_#t~mem8|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume #t~mem8 > 0;havoc #t~mem8;havoc #t~mem7.base, #t~mem7.offset;call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4);~i~0 := #t~mem9 - 10;havoc #t~mem9; VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 9), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 8), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 7), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 6), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 5), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 4), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 3), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 2), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=(- 1), main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !!(~i~0 < #t~mem10);havoc #t~mem10;#t~pre11 := 1 + ~i~0;~i~0 := 1 + ~i~0;havoc #t~pre11; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem10|=1, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !(~i~0 < #t~mem10);havoc #t~mem10; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4);#res := (if #t~mem1 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=1, check_~pc.base=122, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=1, |check_#in~pc.base|=122, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume 0 == #t~ret12;havoc #t~ret12; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] assume !false; VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=106, main_~pa~0.offset=52, |#NULL.base|=0, |#NULL.offset|=0, |main_~#array~0.base|=106, |main_~#array~0.offset|=0, |main_~#cont~0.base|=122, |main_~#cont~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem8; [L32] havoc #t~mem7.base, #t~mem7.offset; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=111, #NULL.offset=107, old(#NULL.base)=111, old(#NULL.offset)=107] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=111, old(#NULL.offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L19] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L20] call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0.base, ~pa~0.offset; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24-L27] assume !!(~j~0 < 10); [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] call write~int(#t~nondet4, ~#array~0.base, ~#array~0.offset + 8 * ~j~0, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] call write~int(#t~nondet5, ~#array~0.base, 4 + (~#array~0.offset + 8 * ~j~0), 4); [L26] havoc #t~nondet5; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L24-L27] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10] [L29-L41] assume ~i~0 >= 0 && ~i~0 < 9; [L30] call write~$Pointer$(~#array~0.base, ~#array~0.offset + 8 * ~i~0, ~#cont~0.base, ~#cont~0.offset, 4); [L31] call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L31] ~pa~0.base, ~pa~0.offset := #t~mem6.base, 4 + #t~mem6.offset; [L31] havoc #t~mem6.base, #t~mem6.offset; [L32] call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L32] call #t~mem8 := read~int(#t~mem7.base, 4 + #t~mem7.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem7.base=106, #t~mem7.offset=48, #t~mem8=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L32-L40] assume #t~mem8 > 0; [L32] havoc #t~mem8; [L32] havoc #t~mem7.base, #t~mem7.offset; [L33] call #t~mem9 := read~int(~#array~0.base, 4 + (~#array~0.offset + 8 * ~i~0), 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-9, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-8, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-7, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-6, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-5, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-4, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-3, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-2, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=-1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !!(~i~0 < #t~mem10); [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34] call #t~mem10 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem10=1, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L34-L36] assume !(~i~0 < #t~mem10); [L34] havoc #t~mem10; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] CALL call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L12-L15] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L12-L15] ~i := #in~i; [L14] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L14] call #t~mem1 := read~int(#t~mem0.base, 12 + #t~mem0.offset, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0.base, #t~mem0.offset; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L12-L15] ensures true; VAL [#in~i=1, #in~pc.base=122, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=1, ~pc.base=122, ~pc.offset=0] [L37] RET call #t~ret12 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L37-L39] assume 0 == #t~ret12; [L37] havoc #t~ret12; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [L45] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#array~0.base=106, ~#array~0.offset=0, ~#cont~0.base=122, ~#cont~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=106, ~pa~0.offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=111, #NULL!offset=107, old(#NULL!base)=111, old(#NULL!offset)=107] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=111, old(#NULL!offset)=107] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret13 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L19] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L20] FCALL call ~#array~0 := #Ultimate.alloc(80); [L21] havoc ~i~0; [L21] havoc ~pa~0; [L22] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L22] ~i~0 := #t~nondet2; [L22] havoc #t~nondet2; [L24] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=0] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=1] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=2] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=3] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=4] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=5] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=6] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=7] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=8] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24-L27] COND FALSE !(!(~j~0 < 10)) [L25] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L25] FCALL call write~int(#t~nondet4, { base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~j~0 }, 4); [L25] havoc #t~nondet4; [L26] assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647; [L26] FCALL call write~int(#t~nondet5, { base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~j~0) }, 4); [L26] havoc #t~nondet5; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=9] [L24] #t~post3 := ~j~0; [L24] ~j~0 := 1 + #t~post3; [L24] havoc #t~post3; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L24-L27] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10] [L29] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L30] FCALL call write~$Pointer$({ base: ~#array~0!base, offset: ~#array~0!offset + 8 * ~i~0 }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] FCALL call #t~mem6 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L31] ~pa~0 := { base: #t~mem6!base, offset: 4 + #t~mem6!offset }; [L31] havoc #t~mem6; [L32] FCALL call #t~mem7 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L32] FCALL call #t~mem8 := read~int({ base: #t~mem7!base, offset: 4 + #t~mem7!offset }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem7!base=106, #t~mem7!offset=48, #t~mem8=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L32] COND TRUE #t~mem8 > 0 [L32] havoc #t~mem8; [L32] havoc #t~mem7; [L33] FCALL call #t~mem9 := read~int({ base: ~#array~0!base, offset: 4 + (~#array~0!offset + 8 * ~i~0) }, 4); [L33] ~i~0 := #t~mem9 - 10; [L33] havoc #t~mem9; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-9, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-8, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-7, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-6, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-5, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-4, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-3, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-2, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=-1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND FALSE !(!(~i~0 < #t~mem10)) [L34] havoc #t~mem10; [L35] #t~pre11 := 1 + ~i~0; [L35] ~i~0 := 1 + ~i~0; [L35] havoc #t~pre11; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34] FCALL call #t~mem10 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem10=1, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L34-L36] COND TRUE !(~i~0 < #t~mem10) [L34] havoc #t~mem10; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] CALL call #t~ret12 := check(~#cont~0, ~i~0); VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L12-L15] ~pc := #in~pc; [L12-L15] ~i := #in~i; [L14] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L14] FCALL call #t~mem1 := read~int({ base: #t~mem0!base, offset: 12 + #t~mem0!offset }, 4); [L14] #res := (if #t~mem1 == ~i then 1 else 0); [L14] havoc #t~mem0; [L14] havoc #t~mem1; VAL [#in~i=1, #in~pc!base=122, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=1, ~pc!base=122, ~pc!offset=0] [L37] RET call #t~ret12 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L37] COND TRUE 0 == #t~ret12 [L37] havoc #t~ret12; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L45] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#array~0!base=106, ~#array~0!offset=0, ~#cont~0!base=122, ~#cont~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=106, ~pa~0!offset=52] [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=6, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=6, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:48}, cont.array[0].b=1, i=6, j=10, pa={106:52}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-9, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=1, j=10, pa={106:52}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] ----- [2018-11-23 12:54:52,220 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test25_false-unreach-call_true-termination.c-witness.graphml [2018-11-23 12:54:52,220 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:54:52,222 INFO L168 Benchmark]: Toolchain (without parser) took 34500.61 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -716.6 MB). Peak memory consumption was 359.2 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:52,222 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:52,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:52,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:52,223 INFO L168 Benchmark]: Boogie Preprocessor took 47.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:54:52,223 INFO L168 Benchmark]: RCFGBuilder took 786.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:52,224 INFO L168 Benchmark]: TraceAbstraction took 33080.65 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 345.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 19.5 MB). Peak memory consumption was 364.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:52,224 INFO L168 Benchmark]: Witness Printer took 163.81 ms. Allocated memory is still 2.6 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:54:52,226 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 382.93 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.04 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 786.23 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 730.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -764.2 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 33080.65 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 345.0 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 19.5 MB). Peak memory consumption was 364.5 MB. Max. memory is 7.1 GB. * Witness Printer took 163.81 ms. Allocated memory is still 2.6 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 45]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L19] struct cont cont; [L20] struct dummy array[10]; [L21] int i, *pa; [L22] i = __VERIFIER_nondet_int() [L24] int j = 0; VAL [array={106:0}, cont={122:0}, i=6, j=0] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=1] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=2] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=3] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=4] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=5] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=6] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=7] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=8] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=9] [L24] COND TRUE j < 10 [L25] array[j].a = __VERIFIER_nondet_int() [L26] array[j].b = __VERIFIER_nondet_int() [L24] j++ VAL [array={106:0}, cont={122:0}, i=6, j=10] [L24] COND FALSE !(j < 10) VAL [array={106:0}, cont={122:0}, i=6, j=10] [L29] COND TRUE i >= 0 && i < 9 [L30] cont.array = &array[i] [L31] EXPR cont.array [L31] pa = &cont.array[0].b [L32] EXPR cont.array [L32] EXPR cont.array[0].b VAL [array={106:0}, cont={122:0}, cont.array={106:48}, cont.array[0].b=1, i=6, j=10, pa={106:52}] [L32] COND TRUE cont.array[0].b > 0 [L33] EXPR array[i].b [L33] i = array[i].b - 10 [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-9, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-8, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-7, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-6, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-5, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-4, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-3, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-2, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=-1, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=0, j=10, pa={106:52}] [L34] COND TRUE i < *pa [L35] ++i VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] EXPR \read(*pa) VAL [\read(*pa)=1, array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] [L34] COND FALSE !(i < *pa) [L37] CALL, EXPR check(&cont, i) VAL [\old(i)=1, pc={122:0}] [L14] EXPR pc->array [L14] EXPR pc->array[1].b [L14] return pc->array[1].b == i; [L37] RET, EXPR check(&cont, i) VAL [array={106:0}, check(&cont, i)=0, cont={122:0}, i=1, j=10, pa={106:52}] [L37] COND TRUE !check(&cont, i) [L45] __VERIFIER_error() VAL [array={106:0}, cont={122:0}, i=1, j=10, pa={106:52}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 32.9s OverallTime, 14 OverallIterations, 11 TraceHistogramMax, 9.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 237 SDtfs, 112 SDslu, 1306 SDs, 0 SdLazy, 933 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 535 GetRequests, 358 SyntacticMatches, 14 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=13, 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.8s AutomataMinimizationTime, 13 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 7.2s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 845 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 763 ConstructedInterpolants, 9 QuantifiedInterpolants, 76678 SizeOfPredicates, 75 NumberOfNonLiveVariables, 1701 ConjunctsInSsa, 142 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 393/1182 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...