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/test24_false-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:54:16,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:54:16,664 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:54:16,676 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:54:16,676 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:54:16,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:54:16,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:54:16,681 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:54:16,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:54:16,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:54:16,685 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:54:16,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:54:16,686 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:54:16,687 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:54:16,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:54:16,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:54:16,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:54:16,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:54:16,695 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:54:16,696 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:54:16,698 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:54:16,699 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:54:16,702 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:54:16,702 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:54:16,702 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:54:16,703 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:54:16,705 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:54:16,705 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:54:16,706 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:54:16,708 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:54:16,708 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:54:16,709 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:54:16,709 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:54:16,709 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:54:16,710 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:54:16,711 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:54:16,712 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,729 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,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:54:16,730 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,731 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:54:16,731 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,732 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:54:16,732 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:54:16,732 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,733 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:54:16,733 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:54:16,733 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:54:16,733 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:54:16,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:54:16,735 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:54:16,735 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:54:16,735 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:54:16,735 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:54:16,735 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:54:16,736 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:54:16,736 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:54:16,785 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:54:16,798 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:54:16,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:54:16,803 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:54:16,804 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:54:16,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test24_false-unreach-call.c [2018-11-23 12:54:16,865 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc1aeef/43d87f089e594d7ab432d8cb9f8d71d6/FLAG25020d6e0 [2018-11-23 12:54:17,353 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:54:17,354 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test24_false-unreach-call.c [2018-11-23 12:54:17,363 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc1aeef/43d87f089e594d7ab432d8cb9f8d71d6/FLAG25020d6e0 [2018-11-23 12:54:17,689 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36dc1aeef/43d87f089e594d7ab432d8cb9f8d71d6 [2018-11-23 12:54:17,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:54:17,702 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:54:17,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:17,704 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:54:17,711 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:54:17,712 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,716 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bba1b4f 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,716 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,724 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:54:17,746 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:54:17,963 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:17,984 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:54:18,022 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:54:18,045 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:54:18,045 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,045 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:54:18,046 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:18,047 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:54:18,047 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:54:18,057 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,071 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,081 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:54:18,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:54:18,082 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:54:18,082 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:54:18,093 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,094 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,096 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,096 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,108 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,114 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,115 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,118 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:54:18,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:54:18,119 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:54:18,119 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:54:18,120 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,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:54:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:54:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:54:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:54:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:54:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:54:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:54:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:54:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:54:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 12:54:18,292 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 12:54:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:54:18,873 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:54:18,874 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:54:18,874 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,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:54:18,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:54:18,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:54:18,879 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:54:18,880 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,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad87239 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,881 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,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ad87239 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,881 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,883 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_false-unreach-call.c [2018-11-23 12:54:18,894 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:54:18,902 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:54:18,921 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:54:18,954 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:54:18,955 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:54:18,955 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:54:18,955 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:54:18,955 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:54:18,956 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:54:18,956 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:54:18,956 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:54:18,956 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:54:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 12:54:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:54:18,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:18,994 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:18,996 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:19,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:19,003 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2018-11-23 12:54:19,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:19,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:19,171 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 12:54:19,175 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,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:19,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #53#return; {28#true} is VALID [2018-11-23 12:54:19,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret9 := main(); {28#true} is VALID [2018-11-23 12:54:19,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {28#true} is VALID [2018-11-23 12:54:19,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 12:54:19,191 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {29#false} is VALID [2018-11-23 12:54:19,192 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {29#false} is VALID [2018-11-23 12:54:19,192 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-23 12:54:19,193 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {28#true} is VALID [2018-11-23 12:54:19,193 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {28#true} is VALID [2018-11-23 12:54:19,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 12:54:19,194 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {28#true} {29#false} #57#return; {29#false} is VALID [2018-11-23 12:54:19,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {29#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {29#false} is VALID [2018-11-23 12:54:19,194 INFO L273 TraceCheckUtils]: 15: Hoare triple {29#false} assume 0 == #t~ret8;havoc #t~ret8; {29#false} is VALID [2018-11-23 12:54:19,195 INFO L273 TraceCheckUtils]: 16: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 12:54:19,198 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,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:19,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:54:19,206 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:19,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:19,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:54:19,356 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,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:54:19,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:54:19,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:54:19,369 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 12:54:19,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,579 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 12:54:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:54:19,580 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 12:54:19,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:19,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 12:54:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:54:19,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 12:54:19,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-23 12:54:19,807 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:19,818 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:54:19,819 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:54:19,822 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,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:54:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:54:19,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:19,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,862 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,862 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,866 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:19,866 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:19,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:19,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:19,867 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,867 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:54:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:19,871 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:54:19,871 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:19,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:19,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:19,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:19,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:54:19,876 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:54:19,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:19,877 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:54:19,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:54:19,877 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:54:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:54:19,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:19,878 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:19,878 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:19,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2018-11-23 12:54:19,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:19,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:19,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:19,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:19,970 INFO L256 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {156#true} is VALID [2018-11-23 12:54:19,970 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:19,971 INFO L273 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:19,971 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #53#return; {156#true} is VALID [2018-11-23 12:54:19,972 INFO L256 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret9 := main(); {156#true} is VALID [2018-11-23 12:54:19,972 INFO L273 TraceCheckUtils]: 5: Hoare triple {156#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {158#(= main_~j~0 0)} is VALID [2018-11-23 12:54:19,976 INFO L273 TraceCheckUtils]: 6: Hoare triple {158#(= main_~j~0 0)} assume !(~j~0 < 20); {157#false} is VALID [2018-11-23 12:54:19,976 INFO L273 TraceCheckUtils]: 7: Hoare triple {157#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {157#false} is VALID [2018-11-23 12:54:19,977 INFO L273 TraceCheckUtils]: 8: Hoare triple {157#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {157#false} is VALID [2018-11-23 12:54:19,977 INFO L273 TraceCheckUtils]: 9: Hoare triple {157#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {157#false} is VALID [2018-11-23 12:54:19,977 INFO L273 TraceCheckUtils]: 10: Hoare triple {157#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {157#false} is VALID [2018-11-23 12:54:19,978 INFO L256 TraceCheckUtils]: 11: Hoare triple {157#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {156#true} is VALID [2018-11-23 12:54:19,978 INFO L273 TraceCheckUtils]: 12: Hoare triple {156#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {156#true} is VALID [2018-11-23 12:54:19,978 INFO L273 TraceCheckUtils]: 13: Hoare triple {156#true} assume true; {156#true} is VALID [2018-11-23 12:54:19,979 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {156#true} {157#false} #57#return; {157#false} is VALID [2018-11-23 12:54:19,979 INFO L273 TraceCheckUtils]: 15: Hoare triple {157#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {157#false} is VALID [2018-11-23 12:54:19,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {157#false} assume 0 == #t~ret8;havoc #t~ret8; {157#false} is VALID [2018-11-23 12:54:19,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {157#false} assume !false; {157#false} is VALID [2018-11-23 12:54:19,981 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,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:54:19,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:54:19,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:19,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:19,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:54:20,126 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,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:54:20,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:54:20,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:54:20,127 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 12:54:20,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,261 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:54:20,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:54:20,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 12:54:20,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:20,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:20,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:54:20,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-23 12:54:20,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-23 12:54:20,516 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,523 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:54:20,523 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:54:20,524 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,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:54:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 12:54:20,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:20,676 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:20,676 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:20,676 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2018-11-23 12:54:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,679 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:20,679 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:20,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:20,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:20,681 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:20,682 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2018-11-23 12:54:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:20,684 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:54:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:54:20,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:20,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:20,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:20,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:20,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:20,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:54:20,690 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 12:54:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:20,691 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:54:20,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:54:20,691 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:54:20,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:54:20,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:20,692 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,692 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:20,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2018-11-23 12:54:20,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:20,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:20,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:20,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,874 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:20,875 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,875 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:20,875 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #53#return; {284#true} is VALID [2018-11-23 12:54:20,876 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret9 := main(); {284#true} is VALID [2018-11-23 12:54:20,876 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:20,878 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {286#(= main_~j~0 0)} is VALID [2018-11-23 12:54:20,880 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:20,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 20); {285#false} is VALID [2018-11-23 12:54:20,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {285#false} is VALID [2018-11-23 12:54:20,885 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {285#false} is VALID [2018-11-23 12:54:20,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:20,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {285#false} is VALID [2018-11-23 12:54:20,886 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {284#true} is VALID [2018-11-23 12:54:20,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {284#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {284#true} is VALID [2018-11-23 12:54:20,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:20,887 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {284#true} {285#false} #57#return; {285#false} is VALID [2018-11-23 12:54:20,888 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:20,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret8;havoc #t~ret8; {285#false} is VALID [2018-11-23 12:54:20,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:20,894 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,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:20,894 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,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:20,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:21,202 INFO L256 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2018-11-23 12:54:21,202 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,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {284#true} assume true; {284#true} is VALID [2018-11-23 12:54:21,203 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {284#true} {284#true} #53#return; {284#true} is VALID [2018-11-23 12:54:21,203 INFO L256 TraceCheckUtils]: 4: Hoare triple {284#true} call #t~ret9 := main(); {284#true} is VALID [2018-11-23 12:54:21,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {284#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:21,234 INFO L273 TraceCheckUtils]: 6: Hoare triple {306#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {306#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:21,250 INFO L273 TraceCheckUtils]: 7: Hoare triple {306#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {287#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:21,266 INFO L273 TraceCheckUtils]: 8: Hoare triple {287#(<= main_~j~0 1)} assume !(~j~0 < 20); {285#false} is VALID [2018-11-23 12:54:21,266 INFO L273 TraceCheckUtils]: 9: Hoare triple {285#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {285#false} is VALID [2018-11-23 12:54:21,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {285#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {285#false} is VALID [2018-11-23 12:54:21,268 INFO L273 TraceCheckUtils]: 11: Hoare triple {285#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {285#false} is VALID [2018-11-23 12:54:21,269 INFO L273 TraceCheckUtils]: 12: Hoare triple {285#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {285#false} is VALID [2018-11-23 12:54:21,269 INFO L256 TraceCheckUtils]: 13: Hoare triple {285#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {285#false} is VALID [2018-11-23 12:54:21,269 INFO L273 TraceCheckUtils]: 14: Hoare triple {285#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {285#false} is VALID [2018-11-23 12:54:21,269 INFO L273 TraceCheckUtils]: 15: Hoare triple {285#false} assume true; {285#false} is VALID [2018-11-23 12:54:21,270 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {285#false} {285#false} #57#return; {285#false} is VALID [2018-11-23 12:54:21,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {285#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {285#false} is VALID [2018-11-23 12:54:21,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {285#false} assume 0 == #t~ret8;havoc #t~ret8; {285#false} is VALID [2018-11-23 12:54:21,271 INFO L273 TraceCheckUtils]: 19: Hoare triple {285#false} assume !false; {285#false} is VALID [2018-11-23 12:54:21,272 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,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:21,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:54:21,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:21,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:21,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:54:21,384 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,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:54:21,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:54:21,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:54:21,385 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 12:54:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:21,591 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:54:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:54:21,592 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:54:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:21,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:54:21,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-23 12:54:21,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-23 12:54:21,720 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,722 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:54:21,722 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:54:21,723 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,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:54:21,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 12:54:21,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:21,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:21,742 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:21,742 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 23 states. [2018-11-23 12:54:21,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:21,745 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:21,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:21,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:21,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:21,746 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:21,746 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 24 states. [2018-11-23 12:54:21,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:21,749 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:54:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:54:21,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:21,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:21,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:21,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:54:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:54:21,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 12:54:21,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:21,752 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:54:21,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:54:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:54:21,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:54:21,753 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:21,754 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,754 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:21,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2018-11-23 12:54:21,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:21,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:21,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:21,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,878 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:21,878 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:21,879 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:21,879 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #53#return; {481#true} is VALID [2018-11-23 12:54:21,879 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret9 := main(); {481#true} is VALID [2018-11-23 12:54:21,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:21,881 INFO L273 TraceCheckUtils]: 6: Hoare triple {483#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {483#(= main_~j~0 0)} is VALID [2018-11-23 12:54:21,883 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:21,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:21,886 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {485#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:21,887 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#(<= main_~j~0 2)} assume !(~j~0 < 20); {482#false} is VALID [2018-11-23 12:54:21,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {482#false} is VALID [2018-11-23 12:54:21,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {482#false} is VALID [2018-11-23 12:54:21,888 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {482#false} is VALID [2018-11-23 12:54:21,888 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {482#false} is VALID [2018-11-23 12:54:21,888 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {481#true} is VALID [2018-11-23 12:54:21,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {481#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {481#true} is VALID [2018-11-23 12:54:21,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:21,889 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {481#true} {482#false} #57#return; {482#false} is VALID [2018-11-23 12:54:21,889 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:21,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret8;havoc #t~ret8; {482#false} is VALID [2018-11-23 12:54:21,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:21,891 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:21,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:21,891 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:21,909 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:21,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:21,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:21,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:21,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:22,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {481#true} call ULTIMATE.init(); {481#true} is VALID [2018-11-23 12:54:22,153 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,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {481#true} assume true; {481#true} is VALID [2018-11-23 12:54:22,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {481#true} {481#true} #53#return; {481#true} is VALID [2018-11-23 12:54:22,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {481#true} call #t~ret9 := main(); {481#true} is VALID [2018-11-23 12:54:22,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {481#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {504#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:22,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {504#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {504#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:22,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {504#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,162 INFO L273 TraceCheckUtils]: 8: Hoare triple {484#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {484#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,163 INFO L273 TraceCheckUtils]: 9: Hoare triple {484#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {485#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:22,163 INFO L273 TraceCheckUtils]: 10: Hoare triple {485#(<= main_~j~0 2)} assume !(~j~0 < 20); {482#false} is VALID [2018-11-23 12:54:22,164 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {482#false} is VALID [2018-11-23 12:54:22,164 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {482#false} is VALID [2018-11-23 12:54:22,164 INFO L273 TraceCheckUtils]: 13: Hoare triple {482#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {482#false} is VALID [2018-11-23 12:54:22,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {482#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {482#false} is VALID [2018-11-23 12:54:22,165 INFO L256 TraceCheckUtils]: 15: Hoare triple {482#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {482#false} is VALID [2018-11-23 12:54:22,165 INFO L273 TraceCheckUtils]: 16: Hoare triple {482#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {482#false} is VALID [2018-11-23 12:54:22,165 INFO L273 TraceCheckUtils]: 17: Hoare triple {482#false} assume true; {482#false} is VALID [2018-11-23 12:54:22,165 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {482#false} {482#false} #57#return; {482#false} is VALID [2018-11-23 12:54:22,166 INFO L273 TraceCheckUtils]: 19: Hoare triple {482#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {482#false} is VALID [2018-11-23 12:54:22,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {482#false} assume 0 == #t~ret8;havoc #t~ret8; {482#false} is VALID [2018-11-23 12:54:22,166 INFO L273 TraceCheckUtils]: 21: Hoare triple {482#false} assume !false; {482#false} is VALID [2018-11-23 12:54:22,167 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,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:22,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:54:22,187 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:54:22,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:22,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:54:22,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:22,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:54:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:54:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:22,225 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-23 12:54:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:22,419 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:54:22,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:54:22,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 12:54:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:22,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:22,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 12:54:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:54:22,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-23 12:54:22,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2018-11-23 12:54:22,508 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:22,510 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:54:22,510 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:54:22,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:54:22,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:54:22,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 12:54:22,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:22,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 25 states. [2018-11-23 12:54:22,531 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 25 states. [2018-11-23 12:54:22,531 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 25 states. [2018-11-23 12:54:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:22,534 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:54:22,534 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:54:22,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:22,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:22,535 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 26 states. [2018-11-23 12:54:22,535 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 26 states. [2018-11-23 12:54:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:22,537 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:54:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:54:22,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:22,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:22,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:22,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:54:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 12:54:22,540 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-23 12:54:22,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:22,540 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 12:54:22,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:54:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:54:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:54:22,542 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:22,542 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:22,542 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:22,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2018-11-23 12:54:22,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:22,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:22,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:22,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:22,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:54:22,677 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 12:54:22,677 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:54:22,678 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #53#return; {695#true} is VALID [2018-11-23 12:54:22,678 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret9 := main(); {695#true} is VALID [2018-11-23 12:54:22,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {697#(= main_~j~0 0)} is VALID [2018-11-23 12:54:22,696 INFO L273 TraceCheckUtils]: 6: Hoare triple {697#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {697#(= main_~j~0 0)} is VALID [2018-11-23 12:54:22,696 INFO L273 TraceCheckUtils]: 7: Hoare triple {697#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,701 INFO L273 TraceCheckUtils]: 8: Hoare triple {698#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:22,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {699#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:22,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {699#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {700#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:22,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {700#(<= main_~j~0 3)} assume !(~j~0 < 20); {696#false} is VALID [2018-11-23 12:54:22,706 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {696#false} is VALID [2018-11-23 12:54:22,706 INFO L273 TraceCheckUtils]: 14: Hoare triple {696#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {696#false} is VALID [2018-11-23 12:54:22,706 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {696#false} is VALID [2018-11-23 12:54:22,706 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {696#false} is VALID [2018-11-23 12:54:22,707 INFO L256 TraceCheckUtils]: 17: Hoare triple {696#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {695#true} is VALID [2018-11-23 12:54:22,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {695#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {695#true} is VALID [2018-11-23 12:54:22,707 INFO L273 TraceCheckUtils]: 19: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:54:22,707 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {695#true} {696#false} #57#return; {696#false} is VALID [2018-11-23 12:54:22,708 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {696#false} is VALID [2018-11-23 12:54:22,708 INFO L273 TraceCheckUtils]: 22: Hoare triple {696#false} assume 0 == #t~ret8;havoc #t~ret8; {696#false} is VALID [2018-11-23 12:54:22,708 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:54:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:22,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:22,709 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:22,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:22,752 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:54:22,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:22,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:22,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:22,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {695#true} call ULTIMATE.init(); {695#true} is VALID [2018-11-23 12:54:22,856 INFO L273 TraceCheckUtils]: 1: Hoare triple {695#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {695#true} is VALID [2018-11-23 12:54:22,856 INFO L273 TraceCheckUtils]: 2: Hoare triple {695#true} assume true; {695#true} is VALID [2018-11-23 12:54:22,856 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {695#true} {695#true} #53#return; {695#true} is VALID [2018-11-23 12:54:22,856 INFO L256 TraceCheckUtils]: 4: Hoare triple {695#true} call #t~ret9 := main(); {695#true} is VALID [2018-11-23 12:54:22,857 INFO L273 TraceCheckUtils]: 5: Hoare triple {695#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {719#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:22,857 INFO L273 TraceCheckUtils]: 6: Hoare triple {719#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {719#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:22,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {719#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,862 INFO L273 TraceCheckUtils]: 8: Hoare triple {698#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {698#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:22,863 INFO L273 TraceCheckUtils]: 9: Hoare triple {698#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:22,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {699#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {699#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:22,864 INFO L273 TraceCheckUtils]: 11: Hoare triple {699#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {700#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:22,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {700#(<= main_~j~0 3)} assume !(~j~0 < 20); {696#false} is VALID [2018-11-23 12:54:22,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {696#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {696#false} is VALID [2018-11-23 12:54:22,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {696#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {696#false} is VALID [2018-11-23 12:54:22,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {696#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {696#false} is VALID [2018-11-23 12:54:22,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {696#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {696#false} is VALID [2018-11-23 12:54:22,866 INFO L256 TraceCheckUtils]: 17: Hoare triple {696#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {696#false} is VALID [2018-11-23 12:54:22,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {696#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {696#false} is VALID [2018-11-23 12:54:22,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {696#false} assume true; {696#false} is VALID [2018-11-23 12:54:22,867 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {696#false} {696#false} #57#return; {696#false} is VALID [2018-11-23 12:54:22,867 INFO L273 TraceCheckUtils]: 21: Hoare triple {696#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {696#false} is VALID [2018-11-23 12:54:22,867 INFO L273 TraceCheckUtils]: 22: Hoare triple {696#false} assume 0 == #t~ret8;havoc #t~ret8; {696#false} is VALID [2018-11-23 12:54:22,868 INFO L273 TraceCheckUtils]: 23: Hoare triple {696#false} assume !false; {696#false} is VALID [2018-11-23 12:54:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:22,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:22,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:54:22,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 12:54:22,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:22,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:54:22,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:22,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:54:22,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:54:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:22,926 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-11-23 12:54:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,076 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:54:23,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:54:23,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 12:54:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:54:23,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-23 12:54:23,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-23 12:54:23,141 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,142 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:54:23,142 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:54:23,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:54:23,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:54:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 12:54:23,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:23,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:23,155 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:23,156 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2018-11-23 12:54:23,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,158 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:23,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:23,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:23,159 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:23,159 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2018-11-23 12:54:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,161 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:54:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:54:23,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:23,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:23,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:23,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:54:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:54:23,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-23 12:54:23,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:23,165 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:54:23,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:54:23,165 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:54:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:54:23,166 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:23,166 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:23,166 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:23,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:23,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2018-11-23 12:54:23,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:23,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:23,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:23,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-23 12:54:23,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-23 12:54:23,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-23 12:54:23,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #53#return; {926#true} is VALID [2018-11-23 12:54:23,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret9 := main(); {926#true} is VALID [2018-11-23 12:54:23,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {928#(= main_~j~0 0)} is VALID [2018-11-23 12:54:23,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {928#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {928#(= main_~j~0 0)} is VALID [2018-11-23 12:54:23,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {928#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {929#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {930#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:23,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:23,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {932#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:23,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {932#(<= main_~j~0 4)} assume !(~j~0 < 20); {927#false} is VALID [2018-11-23 12:54:23,333 INFO L273 TraceCheckUtils]: 15: Hoare triple {927#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {927#false} is VALID [2018-11-23 12:54:23,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {927#false} is VALID [2018-11-23 12:54:23,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {927#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {927#false} is VALID [2018-11-23 12:54:23,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {927#false} is VALID [2018-11-23 12:54:23,334 INFO L256 TraceCheckUtils]: 19: Hoare triple {927#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {926#true} is VALID [2018-11-23 12:54:23,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {926#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {926#true} is VALID [2018-11-23 12:54:23,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-23 12:54:23,335 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {926#true} {927#false} #57#return; {927#false} is VALID [2018-11-23 12:54:23,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {927#false} is VALID [2018-11-23 12:54:23,336 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume 0 == #t~ret8;havoc #t~ret8; {927#false} is VALID [2018-11-23 12:54:23,336 INFO L273 TraceCheckUtils]: 25: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-23 12:54:23,337 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:23,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:23,338 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:23,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:54:23,383 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:54:23,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:23,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:23,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {926#true} call ULTIMATE.init(); {926#true} is VALID [2018-11-23 12:54:23,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {926#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {926#true} is VALID [2018-11-23 12:54:23,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {926#true} assume true; {926#true} is VALID [2018-11-23 12:54:23,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {926#true} {926#true} #53#return; {926#true} is VALID [2018-11-23 12:54:23,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {926#true} call #t~ret9 := main(); {926#true} is VALID [2018-11-23 12:54:23,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {926#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {951#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:23,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {951#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {951#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:23,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {951#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,643 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {929#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:23,644 INFO L273 TraceCheckUtils]: 9: Hoare triple {929#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,645 INFO L273 TraceCheckUtils]: 10: Hoare triple {930#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {930#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:23,645 INFO L273 TraceCheckUtils]: 11: Hoare triple {930#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:23,646 INFO L273 TraceCheckUtils]: 12: Hoare triple {931#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {931#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:23,646 INFO L273 TraceCheckUtils]: 13: Hoare triple {931#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {932#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:23,647 INFO L273 TraceCheckUtils]: 14: Hoare triple {932#(<= main_~j~0 4)} assume !(~j~0 < 20); {927#false} is VALID [2018-11-23 12:54:23,648 INFO L273 TraceCheckUtils]: 15: Hoare triple {927#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {927#false} is VALID [2018-11-23 12:54:23,648 INFO L273 TraceCheckUtils]: 16: Hoare triple {927#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {927#false} is VALID [2018-11-23 12:54:23,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {927#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {927#false} is VALID [2018-11-23 12:54:23,649 INFO L273 TraceCheckUtils]: 18: Hoare triple {927#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {927#false} is VALID [2018-11-23 12:54:23,649 INFO L256 TraceCheckUtils]: 19: Hoare triple {927#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {927#false} is VALID [2018-11-23 12:54:23,649 INFO L273 TraceCheckUtils]: 20: Hoare triple {927#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {927#false} is VALID [2018-11-23 12:54:23,650 INFO L273 TraceCheckUtils]: 21: Hoare triple {927#false} assume true; {927#false} is VALID [2018-11-23 12:54:23,650 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {927#false} {927#false} #57#return; {927#false} is VALID [2018-11-23 12:54:23,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {927#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {927#false} is VALID [2018-11-23 12:54:23,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {927#false} assume 0 == #t~ret8;havoc #t~ret8; {927#false} is VALID [2018-11-23 12:54:23,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {927#false} assume !false; {927#false} is VALID [2018-11-23 12:54:23,653 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:23,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:23,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:54:23,675 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 12:54:23,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:23,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:54:23,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:23,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:54:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:54:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:54:23,744 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-23 12:54:23,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:23,963 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:54:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:54:23,964 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 12:54:23,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:23,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:23,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:54:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-23 12:54:23,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2018-11-23 12:54:24,056 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,058 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:54:24,058 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:54:24,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:54:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 12:54:24,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:24,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:24,075 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:24,075 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2018-11-23 12:54:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,077 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:24,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,078 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:24,078 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2018-11-23 12:54:24,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,080 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:54:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:54:24,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:24,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:24,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:54:24,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:54:24,088 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 12:54:24,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:24,089 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:54:24,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:54:24,089 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:54:24,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:54:24,090 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:24,090 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:24,090 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:24,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:24,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2018-11-23 12:54:24,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:24,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:24,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,264 INFO L256 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2018-11-23 12:54:24,264 INFO L273 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1174#true} is VALID [2018-11-23 12:54:24,265 INFO L273 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2018-11-23 12:54:24,265 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #53#return; {1174#true} is VALID [2018-11-23 12:54:24,265 INFO L256 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret9 := main(); {1174#true} is VALID [2018-11-23 12:54:24,266 INFO L273 TraceCheckUtils]: 5: Hoare triple {1174#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1176#(= main_~j~0 0)} is VALID [2018-11-23 12:54:24,266 INFO L273 TraceCheckUtils]: 6: Hoare triple {1176#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1176#(= main_~j~0 0)} is VALID [2018-11-23 12:54:24,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {1176#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,270 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,271 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:24,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {1180#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:24,275 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1181#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:24,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {1181#(<= main_~j~0 5)} assume !(~j~0 < 20); {1175#false} is VALID [2018-11-23 12:54:24,276 INFO L273 TraceCheckUtils]: 17: Hoare triple {1175#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1175#false} is VALID [2018-11-23 12:54:24,277 INFO L273 TraceCheckUtils]: 18: Hoare triple {1175#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1175#false} is VALID [2018-11-23 12:54:24,277 INFO L273 TraceCheckUtils]: 19: Hoare triple {1175#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1175#false} is VALID [2018-11-23 12:54:24,277 INFO L273 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1175#false} is VALID [2018-11-23 12:54:24,278 INFO L256 TraceCheckUtils]: 21: Hoare triple {1175#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1174#true} is VALID [2018-11-23 12:54:24,278 INFO L273 TraceCheckUtils]: 22: Hoare triple {1174#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1174#true} is VALID [2018-11-23 12:54:24,278 INFO L273 TraceCheckUtils]: 23: Hoare triple {1174#true} assume true; {1174#true} is VALID [2018-11-23 12:54:24,278 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1174#true} {1175#false} #57#return; {1175#false} is VALID [2018-11-23 12:54:24,279 INFO L273 TraceCheckUtils]: 25: Hoare triple {1175#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1175#false} is VALID [2018-11-23 12:54:24,279 INFO L273 TraceCheckUtils]: 26: Hoare triple {1175#false} assume 0 == #t~ret8;havoc #t~ret8; {1175#false} is VALID [2018-11-23 12:54:24,279 INFO L273 TraceCheckUtils]: 27: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2018-11-23 12:54:24,281 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:24,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:24,281 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:24,289 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:54:24,334 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 12:54:24,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:24,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:24,440 INFO L256 TraceCheckUtils]: 0: Hoare triple {1174#true} call ULTIMATE.init(); {1174#true} is VALID [2018-11-23 12:54:24,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {1174#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1174#true} is VALID [2018-11-23 12:54:24,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {1174#true} assume true; {1174#true} is VALID [2018-11-23 12:54:24,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1174#true} {1174#true} #53#return; {1174#true} is VALID [2018-11-23 12:54:24,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {1174#true} call #t~ret9 := main(); {1174#true} is VALID [2018-11-23 12:54:24,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {1174#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1200#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:24,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {1200#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1200#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:24,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {1200#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {1177#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1177#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:24,455 INFO L273 TraceCheckUtils]: 9: Hoare triple {1177#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {1178#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1178#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:24,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {1178#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {1179#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1179#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:24,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {1179#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:24,473 INFO L273 TraceCheckUtils]: 14: Hoare triple {1180#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1180#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:24,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {1180#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1181#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:24,477 INFO L273 TraceCheckUtils]: 16: Hoare triple {1181#(<= main_~j~0 5)} assume !(~j~0 < 20); {1175#false} is VALID [2018-11-23 12:54:24,477 INFO L273 TraceCheckUtils]: 17: Hoare triple {1175#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1175#false} is VALID [2018-11-23 12:54:24,477 INFO L273 TraceCheckUtils]: 18: Hoare triple {1175#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1175#false} is VALID [2018-11-23 12:54:24,477 INFO L273 TraceCheckUtils]: 19: Hoare triple {1175#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1175#false} is VALID [2018-11-23 12:54:24,477 INFO L273 TraceCheckUtils]: 20: Hoare triple {1175#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1175#false} is VALID [2018-11-23 12:54:24,478 INFO L256 TraceCheckUtils]: 21: Hoare triple {1175#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1175#false} is VALID [2018-11-23 12:54:24,478 INFO L273 TraceCheckUtils]: 22: Hoare triple {1175#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1175#false} is VALID [2018-11-23 12:54:24,478 INFO L273 TraceCheckUtils]: 23: Hoare triple {1175#false} assume true; {1175#false} is VALID [2018-11-23 12:54:24,478 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {1175#false} {1175#false} #57#return; {1175#false} is VALID [2018-11-23 12:54:24,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {1175#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1175#false} is VALID [2018-11-23 12:54:24,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {1175#false} assume 0 == #t~ret8;havoc #t~ret8; {1175#false} is VALID [2018-11-23 12:54:24,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {1175#false} assume !false; {1175#false} is VALID [2018-11-23 12:54:24,481 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:24,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:54:24,511 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:54:24,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:24,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:54:24,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:54:24,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:54:24,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:24,562 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-23 12:54:24,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,793 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:54:24,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:54:24,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 12:54:24,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:54:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:54:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-23 12:54:24,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-23 12:54:24,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:24,851 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:54:24,851 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:54:24,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:54:24,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:54:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 12:54:24,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:24,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:24,869 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:24,870 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-23 12:54:24,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,871 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:24,871 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:24,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,872 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:24,872 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-23 12:54:24,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:24,874 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:54:24,874 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:54:24,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:24,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:24,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:24,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:54:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 12:54:24,876 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 12:54:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:24,877 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 12:54:24,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:54:24,877 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:54:24,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:54:24,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:24,878 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:24,878 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:24,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:24,879 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2018-11-23 12:54:24,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:24,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:24,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,070 INFO L256 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2018-11-23 12:54:25,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {1439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1439#true} is VALID [2018-11-23 12:54:25,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2018-11-23 12:54:25,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #53#return; {1439#true} is VALID [2018-11-23 12:54:25,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret9 := main(); {1439#true} is VALID [2018-11-23 12:54:25,091 INFO L273 TraceCheckUtils]: 5: Hoare triple {1439#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1441#(= main_~j~0 0)} is VALID [2018-11-23 12:54:25,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {1441#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1441#(= main_~j~0 0)} is VALID [2018-11-23 12:54:25,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {1441#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:25,110 INFO L273 TraceCheckUtils]: 8: Hoare triple {1442#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:25,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {1442#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:25,119 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:25,120 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:25,123 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:25,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:25,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {1445#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:25,125 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:25,125 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:25,126 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1447#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:25,127 INFO L273 TraceCheckUtils]: 18: Hoare triple {1447#(<= main_~j~0 6)} assume !(~j~0 < 20); {1440#false} is VALID [2018-11-23 12:54:25,127 INFO L273 TraceCheckUtils]: 19: Hoare triple {1440#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1440#false} is VALID [2018-11-23 12:54:25,127 INFO L273 TraceCheckUtils]: 20: Hoare triple {1440#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1440#false} is VALID [2018-11-23 12:54:25,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {1440#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1440#false} is VALID [2018-11-23 12:54:25,127 INFO L273 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1440#false} is VALID [2018-11-23 12:54:25,127 INFO L256 TraceCheckUtils]: 23: Hoare triple {1440#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1439#true} is VALID [2018-11-23 12:54:25,128 INFO L273 TraceCheckUtils]: 24: Hoare triple {1439#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1439#true} is VALID [2018-11-23 12:54:25,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {1439#true} assume true; {1439#true} is VALID [2018-11-23 12:54:25,128 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1439#true} {1440#false} #57#return; {1440#false} is VALID [2018-11-23 12:54:25,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {1440#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1440#false} is VALID [2018-11-23 12:54:25,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {1440#false} assume 0 == #t~ret8;havoc #t~ret8; {1440#false} is VALID [2018-11-23 12:54:25,129 INFO L273 TraceCheckUtils]: 29: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2018-11-23 12:54:25,131 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:25,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:25,131 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:25,139 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:54:25,325 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:54:25,325 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:25,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:26,011 INFO L256 TraceCheckUtils]: 0: Hoare triple {1439#true} call ULTIMATE.init(); {1439#true} is VALID [2018-11-23 12:54:26,011 INFO L273 TraceCheckUtils]: 1: Hoare triple {1439#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1439#true} is VALID [2018-11-23 12:54:26,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {1439#true} assume true; {1439#true} is VALID [2018-11-23 12:54:26,012 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1439#true} {1439#true} #53#return; {1439#true} is VALID [2018-11-23 12:54:26,012 INFO L256 TraceCheckUtils]: 4: Hoare triple {1439#true} call #t~ret9 := main(); {1439#true} is VALID [2018-11-23 12:54:26,013 INFO L273 TraceCheckUtils]: 5: Hoare triple {1439#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1466#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:26,014 INFO L273 TraceCheckUtils]: 6: Hoare triple {1466#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1466#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:26,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {1466#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,022 INFO L273 TraceCheckUtils]: 8: Hoare triple {1442#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1442#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {1442#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {1443#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1443#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {1443#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:26,028 INFO L273 TraceCheckUtils]: 12: Hoare triple {1444#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1444#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:26,029 INFO L273 TraceCheckUtils]: 13: Hoare triple {1444#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:26,030 INFO L273 TraceCheckUtils]: 14: Hoare triple {1445#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1445#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:26,032 INFO L273 TraceCheckUtils]: 15: Hoare triple {1445#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:26,033 INFO L273 TraceCheckUtils]: 16: Hoare triple {1446#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1446#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:26,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {1446#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1447#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:26,034 INFO L273 TraceCheckUtils]: 18: Hoare triple {1447#(<= main_~j~0 6)} assume !(~j~0 < 20); {1440#false} is VALID [2018-11-23 12:54:26,034 INFO L273 TraceCheckUtils]: 19: Hoare triple {1440#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1440#false} is VALID [2018-11-23 12:54:26,035 INFO L273 TraceCheckUtils]: 20: Hoare triple {1440#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1440#false} is VALID [2018-11-23 12:54:26,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {1440#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1440#false} is VALID [2018-11-23 12:54:26,035 INFO L273 TraceCheckUtils]: 22: Hoare triple {1440#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1440#false} is VALID [2018-11-23 12:54:26,035 INFO L256 TraceCheckUtils]: 23: Hoare triple {1440#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1440#false} is VALID [2018-11-23 12:54:26,036 INFO L273 TraceCheckUtils]: 24: Hoare triple {1440#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1440#false} is VALID [2018-11-23 12:54:26,036 INFO L273 TraceCheckUtils]: 25: Hoare triple {1440#false} assume true; {1440#false} is VALID [2018-11-23 12:54:26,036 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1440#false} {1440#false} #57#return; {1440#false} is VALID [2018-11-23 12:54:26,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {1440#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1440#false} is VALID [2018-11-23 12:54:26,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {1440#false} assume 0 == #t~ret8;havoc #t~ret8; {1440#false} is VALID [2018-11-23 12:54:26,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {1440#false} assume !false; {1440#false} is VALID [2018-11-23 12:54:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:26,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:26,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:54:26,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 12:54:26,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:26,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:54:26,108 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:26,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:54:26,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:54:26,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:54:26,109 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-11-23 12:54:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,305 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:54:26,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:54:26,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 12:54:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-23 12:54:26,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:54:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-23 12:54:26,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2018-11-23 12:54:26,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:26,389 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:54:26,389 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:54:26,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:54:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:54:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:54:26,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:26,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:54:26,409 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:54:26,409 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:54:26,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,411 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:54:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:54:26,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,412 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:54:26,412 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:54:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:26,414 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:54:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:54:26,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:26,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:26,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:26,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:26,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:54:26,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:54:26,417 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-23 12:54:26,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:26,417 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:54:26,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:54:26,417 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:54:26,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:54:26,418 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:26,418 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:26,418 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:26,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:26,419 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2018-11-23 12:54:26,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:26,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:26,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,794 INFO L256 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2018-11-23 12:54:26,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {1721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1721#true} is VALID [2018-11-23 12:54:26,795 INFO L273 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 12:54:26,795 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1721#true} #53#return; {1721#true} is VALID [2018-11-23 12:54:26,795 INFO L256 TraceCheckUtils]: 4: Hoare triple {1721#true} call #t~ret9 := main(); {1721#true} is VALID [2018-11-23 12:54:26,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {1721#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1723#(= main_~j~0 0)} is VALID [2018-11-23 12:54:26,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {1723#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1723#(= main_~j~0 0)} is VALID [2018-11-23 12:54:26,797 INFO L273 TraceCheckUtils]: 7: Hoare triple {1723#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:26,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {1724#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,798 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:26,800 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:26,807 INFO L273 TraceCheckUtils]: 12: Hoare triple {1726#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:26,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {1726#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:26,810 INFO L273 TraceCheckUtils]: 14: Hoare triple {1727#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:26,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {1727#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:26,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {1728#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:26,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {1728#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:26,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {1729#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:26,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {1729#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1730#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:26,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {1730#(<= main_~j~0 7)} assume !(~j~0 < 20); {1722#false} is VALID [2018-11-23 12:54:26,818 INFO L273 TraceCheckUtils]: 21: Hoare triple {1722#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1722#false} is VALID [2018-11-23 12:54:26,818 INFO L273 TraceCheckUtils]: 22: Hoare triple {1722#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1722#false} is VALID [2018-11-23 12:54:26,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {1722#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1722#false} is VALID [2018-11-23 12:54:26,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {1722#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1722#false} is VALID [2018-11-23 12:54:26,819 INFO L256 TraceCheckUtils]: 25: Hoare triple {1722#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1721#true} is VALID [2018-11-23 12:54:26,819 INFO L273 TraceCheckUtils]: 26: Hoare triple {1721#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1721#true} is VALID [2018-11-23 12:54:26,819 INFO L273 TraceCheckUtils]: 27: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 12:54:26,819 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1721#true} {1722#false} #57#return; {1722#false} is VALID [2018-11-23 12:54:26,819 INFO L273 TraceCheckUtils]: 29: Hoare triple {1722#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1722#false} is VALID [2018-11-23 12:54:26,819 INFO L273 TraceCheckUtils]: 30: Hoare triple {1722#false} assume 0 == #t~ret8;havoc #t~ret8; {1722#false} is VALID [2018-11-23 12:54:26,819 INFO L273 TraceCheckUtils]: 31: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2018-11-23 12:54:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:26,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:26,820 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:26,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:26,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:27,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {1721#true} call ULTIMATE.init(); {1721#true} is VALID [2018-11-23 12:54:27,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {1721#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1721#true} is VALID [2018-11-23 12:54:27,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {1721#true} assume true; {1721#true} is VALID [2018-11-23 12:54:27,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1721#true} {1721#true} #53#return; {1721#true} is VALID [2018-11-23 12:54:27,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {1721#true} call #t~ret9 := main(); {1721#true} is VALID [2018-11-23 12:54:27,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {1721#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {1749#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:27,158 INFO L273 TraceCheckUtils]: 6: Hoare triple {1749#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1749#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:27,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {1749#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:27,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {1724#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1724#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:27,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {1724#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:27,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {1725#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1725#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:27,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {1725#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:27,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {1726#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1726#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:27,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {1726#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:27,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {1727#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1727#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:27,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {1727#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:27,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {1728#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1728#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:27,168 INFO L273 TraceCheckUtils]: 17: Hoare triple {1728#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:27,176 INFO L273 TraceCheckUtils]: 18: Hoare triple {1729#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {1729#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:27,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {1729#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {1730#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:27,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {1730#(<= main_~j~0 7)} assume !(~j~0 < 20); {1722#false} is VALID [2018-11-23 12:54:27,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {1722#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {1722#false} is VALID [2018-11-23 12:54:27,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {1722#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {1722#false} is VALID [2018-11-23 12:54:27,177 INFO L273 TraceCheckUtils]: 23: Hoare triple {1722#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {1722#false} is VALID [2018-11-23 12:54:27,177 INFO L273 TraceCheckUtils]: 24: Hoare triple {1722#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {1722#false} is VALID [2018-11-23 12:54:27,177 INFO L256 TraceCheckUtils]: 25: Hoare triple {1722#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {1722#false} is VALID [2018-11-23 12:54:27,177 INFO L273 TraceCheckUtils]: 26: Hoare triple {1722#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {1722#false} is VALID [2018-11-23 12:54:27,178 INFO L273 TraceCheckUtils]: 27: Hoare triple {1722#false} assume true; {1722#false} is VALID [2018-11-23 12:54:27,178 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {1722#false} {1722#false} #57#return; {1722#false} is VALID [2018-11-23 12:54:27,178 INFO L273 TraceCheckUtils]: 29: Hoare triple {1722#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {1722#false} is VALID [2018-11-23 12:54:27,178 INFO L273 TraceCheckUtils]: 30: Hoare triple {1722#false} assume 0 == #t~ret8;havoc #t~ret8; {1722#false} is VALID [2018-11-23 12:54:27,178 INFO L273 TraceCheckUtils]: 31: Hoare triple {1722#false} assume !false; {1722#false} is VALID [2018-11-23 12:54:27,179 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:27,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:27,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:54:27,198 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 12:54:27,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:27,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:54:27,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:27,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:54:27,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:54:27,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:27,275 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 12:54:27,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:27,771 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:54:27,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:54:27,772 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 12:54:27,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:54:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-23 12:54:27,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-23 12:54:27,834 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:27,835 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:54:27,836 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:54:27,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:54:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:54:27,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 12:54:27,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:27,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:27,869 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:27,869 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 35 states. [2018-11-23 12:54:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:27,871 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:27,871 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:27,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:27,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:27,872 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:27,872 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 36 states. [2018-11-23 12:54:27,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:27,874 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:54:27,874 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:54:27,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:27,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:27,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:27,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:54:27,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 12:54:27,876 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-23 12:54:27,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:27,877 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 12:54:27,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:54:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:54:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:54:27,877 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:27,878 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:27,878 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:27,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2018-11-23 12:54:27,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:27,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:27,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:27,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:27,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:27,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:28,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:54:28,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:54:28,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:54:28,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #53#return; {2020#true} is VALID [2018-11-23 12:54:28,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret9 := main(); {2020#true} is VALID [2018-11-23 12:54:28,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2022#(= main_~j~0 0)} is VALID [2018-11-23 12:54:28,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {2022#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2022#(= main_~j~0 0)} is VALID [2018-11-23 12:54:28,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {2022#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {2023#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,150 INFO L273 TraceCheckUtils]: 10: Hoare triple {2024#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {2024#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {2025#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {2025#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {2026#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {2026#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:28,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {2027#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:28,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {2027#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:28,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:28,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:28,157 INFO L273 TraceCheckUtils]: 20: Hoare triple {2029#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:28,158 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2030#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:28,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {2030#(<= main_~j~0 8)} assume !(~j~0 < 20); {2021#false} is VALID [2018-11-23 12:54:28,159 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2021#false} is VALID [2018-11-23 12:54:28,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {2021#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2021#false} is VALID [2018-11-23 12:54:28,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {2021#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2021#false} is VALID [2018-11-23 12:54:28,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {2021#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2021#false} is VALID [2018-11-23 12:54:28,159 INFO L256 TraceCheckUtils]: 27: Hoare triple {2021#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2020#true} is VALID [2018-11-23 12:54:28,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2020#true} is VALID [2018-11-23 12:54:28,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:54:28,160 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2020#true} {2021#false} #57#return; {2021#false} is VALID [2018-11-23 12:54:28,160 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2021#false} is VALID [2018-11-23 12:54:28,161 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#false} assume 0 == #t~ret8;havoc #t~ret8; {2021#false} is VALID [2018-11-23 12:54:28,161 INFO L273 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:54:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:28,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:28,163 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:28,175 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:28,203 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:28,203 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:28,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:28,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {2020#true} call ULTIMATE.init(); {2020#true} is VALID [2018-11-23 12:54:28,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {2020#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2020#true} is VALID [2018-11-23 12:54:28,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {2020#true} assume true; {2020#true} is VALID [2018-11-23 12:54:28,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2020#true} {2020#true} #53#return; {2020#true} is VALID [2018-11-23 12:54:28,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {2020#true} call #t~ret9 := main(); {2020#true} is VALID [2018-11-23 12:54:28,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {2020#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2049#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:28,334 INFO L273 TraceCheckUtils]: 6: Hoare triple {2049#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2049#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:28,335 INFO L273 TraceCheckUtils]: 7: Hoare triple {2049#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,335 INFO L273 TraceCheckUtils]: 8: Hoare triple {2023#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2023#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:28,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {2023#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,337 INFO L273 TraceCheckUtils]: 10: Hoare triple {2024#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2024#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:28,337 INFO L273 TraceCheckUtils]: 11: Hoare triple {2024#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {2025#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2025#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:28,339 INFO L273 TraceCheckUtils]: 13: Hoare triple {2025#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,340 INFO L273 TraceCheckUtils]: 14: Hoare triple {2026#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2026#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:28,341 INFO L273 TraceCheckUtils]: 15: Hoare triple {2026#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:28,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {2027#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2027#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:28,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {2027#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:28,343 INFO L273 TraceCheckUtils]: 18: Hoare triple {2028#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2028#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:28,344 INFO L273 TraceCheckUtils]: 19: Hoare triple {2028#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:28,345 INFO L273 TraceCheckUtils]: 20: Hoare triple {2029#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2029#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:28,345 INFO L273 TraceCheckUtils]: 21: Hoare triple {2029#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2030#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:28,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {2030#(<= main_~j~0 8)} assume !(~j~0 < 20); {2021#false} is VALID [2018-11-23 12:54:28,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {2021#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2021#false} is VALID [2018-11-23 12:54:28,347 INFO L273 TraceCheckUtils]: 24: Hoare triple {2021#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2021#false} is VALID [2018-11-23 12:54:28,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {2021#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2021#false} is VALID [2018-11-23 12:54:28,347 INFO L273 TraceCheckUtils]: 26: Hoare triple {2021#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2021#false} is VALID [2018-11-23 12:54:28,348 INFO L256 TraceCheckUtils]: 27: Hoare triple {2021#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2021#false} is VALID [2018-11-23 12:54:28,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {2021#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2021#false} is VALID [2018-11-23 12:54:28,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {2021#false} assume true; {2021#false} is VALID [2018-11-23 12:54:28,349 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2021#false} {2021#false} #57#return; {2021#false} is VALID [2018-11-23 12:54:28,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {2021#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2021#false} is VALID [2018-11-23 12:54:28,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {2021#false} assume 0 == #t~ret8;havoc #t~ret8; {2021#false} is VALID [2018-11-23 12:54:28,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {2021#false} assume !false; {2021#false} is VALID [2018-11-23 12:54:28,350 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:28,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:28,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:54:28,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 12:54:28,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:28,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:54:28,414 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:28,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:54:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:54:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:28,416 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-23 12:54:28,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,665 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:54:28,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:54:28,666 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 12:54:28,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:28,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-23 12:54:28,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:54:28,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-23 12:54:28,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2018-11-23 12:54:28,724 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:28,725 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:54:28,725 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:54:28,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:54:28,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:54:28,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 12:54:28,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:28,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2018-11-23 12:54:28,951 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2018-11-23 12:54:28,951 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2018-11-23 12:54:28,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,953 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:54:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:54:28,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:28,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:28,955 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2018-11-23 12:54:28,955 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2018-11-23 12:54:28,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:28,956 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:54:28,957 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:54:28,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:28,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:28,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:28,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:28,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:54:28,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 12:54:28,959 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-23 12:54:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:28,959 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 12:54:28,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:54:28,960 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:54:28,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:54:28,960 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:28,960 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:28,962 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:28,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:28,963 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2018-11-23 12:54:28,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:28,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:28,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:28,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:28,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:29,240 INFO L256 TraceCheckUtils]: 0: Hoare triple {2336#true} call ULTIMATE.init(); {2336#true} is VALID [2018-11-23 12:54:29,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {2336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2336#true} is VALID [2018-11-23 12:54:29,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {2336#true} assume true; {2336#true} is VALID [2018-11-23 12:54:29,241 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2336#true} {2336#true} #53#return; {2336#true} is VALID [2018-11-23 12:54:29,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {2336#true} call #t~ret9 := main(); {2336#true} is VALID [2018-11-23 12:54:29,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {2336#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2338#(= main_~j~0 0)} is VALID [2018-11-23 12:54:29,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {2338#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2338#(= main_~j~0 0)} is VALID [2018-11-23 12:54:29,243 INFO L273 TraceCheckUtils]: 7: Hoare triple {2338#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:29,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {2339#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:29,244 INFO L273 TraceCheckUtils]: 9: Hoare triple {2339#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:29,245 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:29,246 INFO L273 TraceCheckUtils]: 11: Hoare triple {2340#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:29,246 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:29,247 INFO L273 TraceCheckUtils]: 13: Hoare triple {2341#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:29,248 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:29,248 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:29,249 INFO L273 TraceCheckUtils]: 16: Hoare triple {2343#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:29,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {2343#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:29,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {2344#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:29,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {2344#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:29,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {2345#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:29,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {2345#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:29,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {2346#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:29,254 INFO L273 TraceCheckUtils]: 23: Hoare triple {2346#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2347#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:29,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {2347#(<= main_~j~0 9)} assume !(~j~0 < 20); {2337#false} is VALID [2018-11-23 12:54:29,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {2337#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2337#false} is VALID [2018-11-23 12:54:29,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {2337#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2337#false} is VALID [2018-11-23 12:54:29,255 INFO L273 TraceCheckUtils]: 27: Hoare triple {2337#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2337#false} is VALID [2018-11-23 12:54:29,255 INFO L273 TraceCheckUtils]: 28: Hoare triple {2337#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2337#false} is VALID [2018-11-23 12:54:29,256 INFO L256 TraceCheckUtils]: 29: Hoare triple {2337#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2336#true} is VALID [2018-11-23 12:54:29,256 INFO L273 TraceCheckUtils]: 30: Hoare triple {2336#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2336#true} is VALID [2018-11-23 12:54:29,256 INFO L273 TraceCheckUtils]: 31: Hoare triple {2336#true} assume true; {2336#true} is VALID [2018-11-23 12:54:29,256 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2336#true} {2337#false} #57#return; {2337#false} is VALID [2018-11-23 12:54:29,257 INFO L273 TraceCheckUtils]: 33: Hoare triple {2337#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2337#false} is VALID [2018-11-23 12:54:29,257 INFO L273 TraceCheckUtils]: 34: Hoare triple {2337#false} assume 0 == #t~ret8;havoc #t~ret8; {2337#false} is VALID [2018-11-23 12:54:29,257 INFO L273 TraceCheckUtils]: 35: Hoare triple {2337#false} assume !false; {2337#false} is VALID [2018-11-23 12:54:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:29,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:29,259 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:29,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:29,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 12:54:29,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:29,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:29,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:29,585 INFO L256 TraceCheckUtils]: 0: Hoare triple {2336#true} call ULTIMATE.init(); {2336#true} is VALID [2018-11-23 12:54:29,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {2336#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2336#true} is VALID [2018-11-23 12:54:29,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {2336#true} assume true; {2336#true} is VALID [2018-11-23 12:54:29,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2336#true} {2336#true} #53#return; {2336#true} is VALID [2018-11-23 12:54:29,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {2336#true} call #t~ret9 := main(); {2336#true} is VALID [2018-11-23 12:54:29,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {2336#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2366#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:29,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {2366#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2366#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:29,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {2366#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:29,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {2339#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2339#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:29,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {2339#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:29,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {2340#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2340#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:29,604 INFO L273 TraceCheckUtils]: 11: Hoare triple {2340#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:29,607 INFO L273 TraceCheckUtils]: 12: Hoare triple {2341#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2341#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:29,607 INFO L273 TraceCheckUtils]: 13: Hoare triple {2341#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:29,608 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2342#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:29,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:29,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {2343#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2343#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:29,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {2343#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:29,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {2344#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2344#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:29,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {2344#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:29,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {2345#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2345#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:29,615 INFO L273 TraceCheckUtils]: 21: Hoare triple {2345#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:29,615 INFO L273 TraceCheckUtils]: 22: Hoare triple {2346#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2346#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:29,616 INFO L273 TraceCheckUtils]: 23: Hoare triple {2346#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2347#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:29,616 INFO L273 TraceCheckUtils]: 24: Hoare triple {2347#(<= main_~j~0 9)} assume !(~j~0 < 20); {2337#false} is VALID [2018-11-23 12:54:29,616 INFO L273 TraceCheckUtils]: 25: Hoare triple {2337#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2337#false} is VALID [2018-11-23 12:54:29,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {2337#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2337#false} is VALID [2018-11-23 12:54:29,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {2337#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2337#false} is VALID [2018-11-23 12:54:29,617 INFO L273 TraceCheckUtils]: 28: Hoare triple {2337#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2337#false} is VALID [2018-11-23 12:54:29,617 INFO L256 TraceCheckUtils]: 29: Hoare triple {2337#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2337#false} is VALID [2018-11-23 12:54:29,617 INFO L273 TraceCheckUtils]: 30: Hoare triple {2337#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2337#false} is VALID [2018-11-23 12:54:29,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {2337#false} assume true; {2337#false} is VALID [2018-11-23 12:54:29,618 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {2337#false} {2337#false} #57#return; {2337#false} is VALID [2018-11-23 12:54:29,618 INFO L273 TraceCheckUtils]: 33: Hoare triple {2337#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2337#false} is VALID [2018-11-23 12:54:29,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {2337#false} assume 0 == #t~ret8;havoc #t~ret8; {2337#false} is VALID [2018-11-23 12:54:29,619 INFO L273 TraceCheckUtils]: 35: Hoare triple {2337#false} assume !false; {2337#false} is VALID [2018-11-23 12:54:29,620 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:29,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:29,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:54:29,640 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:54:29,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:29,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:54:29,689 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:29,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:54:29,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:54:29,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:54:29,690 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-23 12:54:29,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:29,968 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 12:54:29,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:54:29,969 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 12:54:29,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:29,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:54:29,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-23 12:54:29,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:54:29,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-23 12:54:29,972 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 54 transitions. [2018-11-23 12:54:30,069 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:30,070 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:54:30,070 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:54:30,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:54:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:54:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 12:54:30,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:30,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:30,084 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:30,085 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-23 12:54:30,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:30,086 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:54:30,086 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:54:30,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:30,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:30,087 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-23 12:54:30,087 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-23 12:54:30,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:30,088 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:54:30,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:54:30,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:30,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:30,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:30,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:30,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:54:30,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:54:30,090 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-11-23 12:54:30,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:30,090 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:54:30,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:54:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:54:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:54:30,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:30,091 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:30,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:30,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:30,092 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2018-11-23 12:54:30,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:30,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:30,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:30,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:30,324 INFO L256 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2018-11-23 12:54:30,324 INFO L273 TraceCheckUtils]: 1: Hoare triple {2669#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2669#true} is VALID [2018-11-23 12:54:30,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2018-11-23 12:54:30,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #53#return; {2669#true} is VALID [2018-11-23 12:54:30,325 INFO L256 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret9 := main(); {2669#true} is VALID [2018-11-23 12:54:30,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2671#(= main_~j~0 0)} is VALID [2018-11-23 12:54:30,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {2671#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2671#(= main_~j~0 0)} is VALID [2018-11-23 12:54:30,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {2671#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2672#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:30,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {2672#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2672#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:30,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {2672#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2673#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:30,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {2673#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2673#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:30,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {2673#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2674#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:30,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {2674#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2674#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:30,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {2674#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2675#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:30,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {2675#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2675#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:30,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {2675#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2676#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:30,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {2676#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2676#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:30,334 INFO L273 TraceCheckUtils]: 17: Hoare triple {2676#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2677#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:30,335 INFO L273 TraceCheckUtils]: 18: Hoare triple {2677#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2677#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:30,336 INFO L273 TraceCheckUtils]: 19: Hoare triple {2677#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2678#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:30,336 INFO L273 TraceCheckUtils]: 20: Hoare triple {2678#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2678#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:30,337 INFO L273 TraceCheckUtils]: 21: Hoare triple {2678#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2679#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:30,338 INFO L273 TraceCheckUtils]: 22: Hoare triple {2679#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2679#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:30,339 INFO L273 TraceCheckUtils]: 23: Hoare triple {2679#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2680#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:30,339 INFO L273 TraceCheckUtils]: 24: Hoare triple {2680#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2680#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:30,340 INFO L273 TraceCheckUtils]: 25: Hoare triple {2680#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2681#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:30,341 INFO L273 TraceCheckUtils]: 26: Hoare triple {2681#(<= main_~j~0 10)} assume !(~j~0 < 20); {2670#false} is VALID [2018-11-23 12:54:30,341 INFO L273 TraceCheckUtils]: 27: Hoare triple {2670#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2670#false} is VALID [2018-11-23 12:54:30,342 INFO L273 TraceCheckUtils]: 28: Hoare triple {2670#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2670#false} is VALID [2018-11-23 12:54:30,342 INFO L273 TraceCheckUtils]: 29: Hoare triple {2670#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2670#false} is VALID [2018-11-23 12:54:30,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {2670#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2670#false} is VALID [2018-11-23 12:54:30,343 INFO L256 TraceCheckUtils]: 31: Hoare triple {2670#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2669#true} is VALID [2018-11-23 12:54:30,343 INFO L273 TraceCheckUtils]: 32: Hoare triple {2669#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2669#true} is VALID [2018-11-23 12:54:30,343 INFO L273 TraceCheckUtils]: 33: Hoare triple {2669#true} assume true; {2669#true} is VALID [2018-11-23 12:54:30,344 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2669#true} {2670#false} #57#return; {2670#false} is VALID [2018-11-23 12:54:30,344 INFO L273 TraceCheckUtils]: 35: Hoare triple {2670#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2670#false} is VALID [2018-11-23 12:54:30,344 INFO L273 TraceCheckUtils]: 36: Hoare triple {2670#false} assume 0 == #t~ret8;havoc #t~ret8; {2670#false} is VALID [2018-11-23 12:54:30,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2018-11-23 12:54:30,347 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:30,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:30,348 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:30,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:54:30,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:54:30,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:30,423 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:30,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {2669#true} call ULTIMATE.init(); {2669#true} is VALID [2018-11-23 12:54:30,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {2669#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2669#true} is VALID [2018-11-23 12:54:30,578 INFO L273 TraceCheckUtils]: 2: Hoare triple {2669#true} assume true; {2669#true} is VALID [2018-11-23 12:54:30,578 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2669#true} {2669#true} #53#return; {2669#true} is VALID [2018-11-23 12:54:30,578 INFO L256 TraceCheckUtils]: 4: Hoare triple {2669#true} call #t~ret9 := main(); {2669#true} is VALID [2018-11-23 12:54:30,591 INFO L273 TraceCheckUtils]: 5: Hoare triple {2669#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {2700#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:30,600 INFO L273 TraceCheckUtils]: 6: Hoare triple {2700#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2700#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:30,610 INFO L273 TraceCheckUtils]: 7: Hoare triple {2700#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2672#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:30,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {2672#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2672#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:30,634 INFO L273 TraceCheckUtils]: 9: Hoare triple {2672#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2673#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:30,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {2673#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2673#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:30,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {2673#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2674#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:30,667 INFO L273 TraceCheckUtils]: 12: Hoare triple {2674#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2674#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:30,677 INFO L273 TraceCheckUtils]: 13: Hoare triple {2674#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2675#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:30,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {2675#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2675#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:30,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {2675#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2676#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:30,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {2676#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2676#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:30,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {2676#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2677#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:30,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {2677#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2677#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:30,693 INFO L273 TraceCheckUtils]: 19: Hoare triple {2677#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2678#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:30,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {2678#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2678#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:30,696 INFO L273 TraceCheckUtils]: 21: Hoare triple {2678#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2679#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:30,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {2679#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2679#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:30,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {2679#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2680#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:30,697 INFO L273 TraceCheckUtils]: 24: Hoare triple {2680#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {2680#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:30,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {2680#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {2681#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:30,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {2681#(<= main_~j~0 10)} assume !(~j~0 < 20); {2670#false} is VALID [2018-11-23 12:54:30,698 INFO L273 TraceCheckUtils]: 27: Hoare triple {2670#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {2670#false} is VALID [2018-11-23 12:54:30,698 INFO L273 TraceCheckUtils]: 28: Hoare triple {2670#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {2670#false} is VALID [2018-11-23 12:54:30,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {2670#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {2670#false} is VALID [2018-11-23 12:54:30,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {2670#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {2670#false} is VALID [2018-11-23 12:54:30,699 INFO L256 TraceCheckUtils]: 31: Hoare triple {2670#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {2670#false} is VALID [2018-11-23 12:54:30,699 INFO L273 TraceCheckUtils]: 32: Hoare triple {2670#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {2670#false} is VALID [2018-11-23 12:54:30,699 INFO L273 TraceCheckUtils]: 33: Hoare triple {2670#false} assume true; {2670#false} is VALID [2018-11-23 12:54:30,699 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2670#false} {2670#false} #57#return; {2670#false} is VALID [2018-11-23 12:54:30,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {2670#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {2670#false} is VALID [2018-11-23 12:54:30,700 INFO L273 TraceCheckUtils]: 36: Hoare triple {2670#false} assume 0 == #t~ret8;havoc #t~ret8; {2670#false} is VALID [2018-11-23 12:54:30,700 INFO L273 TraceCheckUtils]: 37: Hoare triple {2670#false} assume !false; {2670#false} is VALID [2018-11-23 12:54:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:30,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:30,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:54:30,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-23 12:54:30,722 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:30,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:54:30,780 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:30,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:54:30,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:54:30,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:54:30,781 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2018-11-23 12:54:31,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:31,229 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:54:31,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:54:31,229 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-23 12:54:31,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 12:54:31,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:54:31,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-23 12:54:31,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-23 12:54:31,303 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:31,304 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:54:31,304 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:54:31,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:54:31,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:54:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 12:54:31,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:31,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:31,380 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:31,381 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 12:54:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:31,382 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:54:31,382 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:54:31,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:31,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:31,382 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 12:54:31,382 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 12:54:31,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:31,383 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:54:31,383 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:54:31,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:31,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:31,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:31,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:31,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:54:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 12:54:31,385 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-23 12:54:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:31,385 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 12:54:31,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:54:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:54:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:54:31,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:31,385 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:31,386 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:31,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:31,386 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2018-11-23 12:54:31,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:31,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:31,387 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:31,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:31,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3019#true} is VALID [2018-11-23 12:54:31,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {3019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3019#true} is VALID [2018-11-23 12:54:31,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2018-11-23 12:54:31,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #53#return; {3019#true} is VALID [2018-11-23 12:54:31,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret9 := main(); {3019#true} is VALID [2018-11-23 12:54:31,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {3019#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3021#(= main_~j~0 0)} is VALID [2018-11-23 12:54:31,637 INFO L273 TraceCheckUtils]: 6: Hoare triple {3021#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3021#(= main_~j~0 0)} is VALID [2018-11-23 12:54:31,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {3021#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3022#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:31,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {3022#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3022#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:31,638 INFO L273 TraceCheckUtils]: 9: Hoare triple {3022#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3023#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:31,639 INFO L273 TraceCheckUtils]: 10: Hoare triple {3023#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3023#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:31,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {3023#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3024#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:31,640 INFO L273 TraceCheckUtils]: 12: Hoare triple {3024#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3024#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:31,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {3024#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3025#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:31,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {3025#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3025#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:31,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {3025#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3026#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:31,642 INFO L273 TraceCheckUtils]: 16: Hoare triple {3026#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3026#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:31,643 INFO L273 TraceCheckUtils]: 17: Hoare triple {3026#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3027#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:31,643 INFO L273 TraceCheckUtils]: 18: Hoare triple {3027#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3027#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:31,644 INFO L273 TraceCheckUtils]: 19: Hoare triple {3027#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3028#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:31,645 INFO L273 TraceCheckUtils]: 20: Hoare triple {3028#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3028#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:31,646 INFO L273 TraceCheckUtils]: 21: Hoare triple {3028#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3029#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:31,646 INFO L273 TraceCheckUtils]: 22: Hoare triple {3029#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3029#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:31,647 INFO L273 TraceCheckUtils]: 23: Hoare triple {3029#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3030#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:31,647 INFO L273 TraceCheckUtils]: 24: Hoare triple {3030#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3030#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:31,648 INFO L273 TraceCheckUtils]: 25: Hoare triple {3030#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3031#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:31,649 INFO L273 TraceCheckUtils]: 26: Hoare triple {3031#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3031#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:31,650 INFO L273 TraceCheckUtils]: 27: Hoare triple {3031#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3032#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:31,650 INFO L273 TraceCheckUtils]: 28: Hoare triple {3032#(<= main_~j~0 11)} assume !(~j~0 < 20); {3020#false} is VALID [2018-11-23 12:54:31,651 INFO L273 TraceCheckUtils]: 29: Hoare triple {3020#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3020#false} is VALID [2018-11-23 12:54:31,651 INFO L273 TraceCheckUtils]: 30: Hoare triple {3020#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3020#false} is VALID [2018-11-23 12:54:31,651 INFO L273 TraceCheckUtils]: 31: Hoare triple {3020#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3020#false} is VALID [2018-11-23 12:54:31,651 INFO L273 TraceCheckUtils]: 32: Hoare triple {3020#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3020#false} is VALID [2018-11-23 12:54:31,651 INFO L256 TraceCheckUtils]: 33: Hoare triple {3020#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3019#true} is VALID [2018-11-23 12:54:31,652 INFO L273 TraceCheckUtils]: 34: Hoare triple {3019#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3019#true} is VALID [2018-11-23 12:54:31,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {3019#true} assume true; {3019#true} is VALID [2018-11-23 12:54:31,652 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3019#true} {3020#false} #57#return; {3020#false} is VALID [2018-11-23 12:54:31,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {3020#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3020#false} is VALID [2018-11-23 12:54:31,652 INFO L273 TraceCheckUtils]: 38: Hoare triple {3020#false} assume 0 == #t~ret8;havoc #t~ret8; {3020#false} is VALID [2018-11-23 12:54:31,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2018-11-23 12:54:31,654 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:31,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:31,654 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:31,663 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:54:31,891 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 12:54:31,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:31,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:32,030 INFO L256 TraceCheckUtils]: 0: Hoare triple {3019#true} call ULTIMATE.init(); {3019#true} is VALID [2018-11-23 12:54:32,030 INFO L273 TraceCheckUtils]: 1: Hoare triple {3019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3019#true} is VALID [2018-11-23 12:54:32,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {3019#true} assume true; {3019#true} is VALID [2018-11-23 12:54:32,031 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3019#true} {3019#true} #53#return; {3019#true} is VALID [2018-11-23 12:54:32,031 INFO L256 TraceCheckUtils]: 4: Hoare triple {3019#true} call #t~ret9 := main(); {3019#true} is VALID [2018-11-23 12:54:32,049 INFO L273 TraceCheckUtils]: 5: Hoare triple {3019#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3051#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:32,058 INFO L273 TraceCheckUtils]: 6: Hoare triple {3051#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3051#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:32,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {3051#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3022#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,059 INFO L273 TraceCheckUtils]: 8: Hoare triple {3022#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3022#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,059 INFO L273 TraceCheckUtils]: 9: Hoare triple {3022#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3023#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,060 INFO L273 TraceCheckUtils]: 10: Hoare triple {3023#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3023#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,061 INFO L273 TraceCheckUtils]: 11: Hoare triple {3023#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3024#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,061 INFO L273 TraceCheckUtils]: 12: Hoare triple {3024#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3024#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,062 INFO L273 TraceCheckUtils]: 13: Hoare triple {3024#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3025#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,063 INFO L273 TraceCheckUtils]: 14: Hoare triple {3025#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3025#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {3025#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3026#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {3026#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3026#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,068 INFO L273 TraceCheckUtils]: 17: Hoare triple {3026#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3027#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {3027#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3027#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {3027#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3028#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:32,070 INFO L273 TraceCheckUtils]: 20: Hoare triple {3028#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3028#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:32,070 INFO L273 TraceCheckUtils]: 21: Hoare triple {3028#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3029#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:32,071 INFO L273 TraceCheckUtils]: 22: Hoare triple {3029#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3029#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:32,072 INFO L273 TraceCheckUtils]: 23: Hoare triple {3029#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3030#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:32,072 INFO L273 TraceCheckUtils]: 24: Hoare triple {3030#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3030#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:32,073 INFO L273 TraceCheckUtils]: 25: Hoare triple {3030#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3031#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:32,074 INFO L273 TraceCheckUtils]: 26: Hoare triple {3031#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3031#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:32,075 INFO L273 TraceCheckUtils]: 27: Hoare triple {3031#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3032#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:32,076 INFO L273 TraceCheckUtils]: 28: Hoare triple {3032#(<= main_~j~0 11)} assume !(~j~0 < 20); {3020#false} is VALID [2018-11-23 12:54:32,076 INFO L273 TraceCheckUtils]: 29: Hoare triple {3020#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3020#false} is VALID [2018-11-23 12:54:32,076 INFO L273 TraceCheckUtils]: 30: Hoare triple {3020#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3020#false} is VALID [2018-11-23 12:54:32,077 INFO L273 TraceCheckUtils]: 31: Hoare triple {3020#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3020#false} is VALID [2018-11-23 12:54:32,077 INFO L273 TraceCheckUtils]: 32: Hoare triple {3020#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3020#false} is VALID [2018-11-23 12:54:32,077 INFO L256 TraceCheckUtils]: 33: Hoare triple {3020#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3020#false} is VALID [2018-11-23 12:54:32,077 INFO L273 TraceCheckUtils]: 34: Hoare triple {3020#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3020#false} is VALID [2018-11-23 12:54:32,078 INFO L273 TraceCheckUtils]: 35: Hoare triple {3020#false} assume true; {3020#false} is VALID [2018-11-23 12:54:32,078 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {3020#false} {3020#false} #57#return; {3020#false} is VALID [2018-11-23 12:54:32,078 INFO L273 TraceCheckUtils]: 37: Hoare triple {3020#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3020#false} is VALID [2018-11-23 12:54:32,079 INFO L273 TraceCheckUtils]: 38: Hoare triple {3020#false} assume 0 == #t~ret8;havoc #t~ret8; {3020#false} is VALID [2018-11-23 12:54:32,079 INFO L273 TraceCheckUtils]: 39: Hoare triple {3020#false} assume !false; {3020#false} is VALID [2018-11-23 12:54:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:32,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:32,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:54:32,102 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 12:54:32,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:32,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:54:32,153 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:32,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:54:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:54:32,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:54:32,154 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2018-11-23 12:54:32,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,451 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 12:54:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:54:32,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 12:54:32,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:32,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:54:32,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-23 12:54:32,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:54:32,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-23 12:54:32,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2018-11-23 12:54:32,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:32,514 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:54:32,514 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:54:32,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:54:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:54:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 12:54:32,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:32,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 12:54:32,549 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 12:54:32,549 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 12:54:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,551 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:54:32,551 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:54:32,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:32,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:32,551 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 12:54:32,551 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 12:54:32,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:32,553 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:54:32,553 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:54:32,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:32,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:32,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:32,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:54:32,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 12:54:32,555 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-11-23 12:54:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:32,555 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 12:54:32,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:54:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:54:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:54:32,556 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:32,556 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:32,556 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:32,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:32,557 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2018-11-23 12:54:32,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:32,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:32,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:32,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:32,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:32,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {3386#true} call ULTIMATE.init(); {3386#true} is VALID [2018-11-23 12:54:32,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {3386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3386#true} is VALID [2018-11-23 12:54:32,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {3386#true} assume true; {3386#true} is VALID [2018-11-23 12:54:32,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3386#true} {3386#true} #53#return; {3386#true} is VALID [2018-11-23 12:54:32,873 INFO L256 TraceCheckUtils]: 4: Hoare triple {3386#true} call #t~ret9 := main(); {3386#true} is VALID [2018-11-23 12:54:32,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {3386#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3388#(= main_~j~0 0)} is VALID [2018-11-23 12:54:32,874 INFO L273 TraceCheckUtils]: 6: Hoare triple {3388#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3388#(= main_~j~0 0)} is VALID [2018-11-23 12:54:32,875 INFO L273 TraceCheckUtils]: 7: Hoare triple {3388#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3389#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {3389#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3389#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:32,876 INFO L273 TraceCheckUtils]: 9: Hoare triple {3389#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3390#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {3390#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3390#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:32,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {3390#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3391#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {3391#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3391#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:32,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {3391#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3392#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {3392#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3392#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:32,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {3392#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3393#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,881 INFO L273 TraceCheckUtils]: 16: Hoare triple {3393#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3393#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:32,882 INFO L273 TraceCheckUtils]: 17: Hoare triple {3393#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3394#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,883 INFO L273 TraceCheckUtils]: 18: Hoare triple {3394#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3394#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:32,884 INFO L273 TraceCheckUtils]: 19: Hoare triple {3394#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3395#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:32,884 INFO L273 TraceCheckUtils]: 20: Hoare triple {3395#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3395#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:32,885 INFO L273 TraceCheckUtils]: 21: Hoare triple {3395#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3396#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:32,886 INFO L273 TraceCheckUtils]: 22: Hoare triple {3396#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3396#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:32,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {3396#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3397#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:32,888 INFO L273 TraceCheckUtils]: 24: Hoare triple {3397#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3397#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:32,888 INFO L273 TraceCheckUtils]: 25: Hoare triple {3397#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3398#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:32,889 INFO L273 TraceCheckUtils]: 26: Hoare triple {3398#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3398#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:32,890 INFO L273 TraceCheckUtils]: 27: Hoare triple {3398#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3399#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:32,891 INFO L273 TraceCheckUtils]: 28: Hoare triple {3399#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3399#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:32,892 INFO L273 TraceCheckUtils]: 29: Hoare triple {3399#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3400#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:32,892 INFO L273 TraceCheckUtils]: 30: Hoare triple {3400#(<= main_~j~0 12)} assume !(~j~0 < 20); {3387#false} is VALID [2018-11-23 12:54:32,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {3387#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3387#false} is VALID [2018-11-23 12:54:32,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {3387#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3387#false} is VALID [2018-11-23 12:54:32,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {3387#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3387#false} is VALID [2018-11-23 12:54:32,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {3387#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3387#false} is VALID [2018-11-23 12:54:32,894 INFO L256 TraceCheckUtils]: 35: Hoare triple {3387#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3386#true} is VALID [2018-11-23 12:54:32,894 INFO L273 TraceCheckUtils]: 36: Hoare triple {3386#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3386#true} is VALID [2018-11-23 12:54:32,894 INFO L273 TraceCheckUtils]: 37: Hoare triple {3386#true} assume true; {3386#true} is VALID [2018-11-23 12:54:32,895 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3386#true} {3387#false} #57#return; {3387#false} is VALID [2018-11-23 12:54:32,895 INFO L273 TraceCheckUtils]: 39: Hoare triple {3387#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3387#false} is VALID [2018-11-23 12:54:32,895 INFO L273 TraceCheckUtils]: 40: Hoare triple {3387#false} assume 0 == #t~ret8;havoc #t~ret8; {3387#false} is VALID [2018-11-23 12:54:32,895 INFO L273 TraceCheckUtils]: 41: Hoare triple {3387#false} assume !false; {3387#false} is VALID [2018-11-23 12:54:32,898 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:32,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:32,898 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:32,907 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:54:34,154 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:54:34,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:34,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:34,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {3386#true} call ULTIMATE.init(); {3386#true} is VALID [2018-11-23 12:54:34,322 INFO L273 TraceCheckUtils]: 1: Hoare triple {3386#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3386#true} is VALID [2018-11-23 12:54:34,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {3386#true} assume true; {3386#true} is VALID [2018-11-23 12:54:34,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3386#true} {3386#true} #53#return; {3386#true} is VALID [2018-11-23 12:54:34,323 INFO L256 TraceCheckUtils]: 4: Hoare triple {3386#true} call #t~ret9 := main(); {3386#true} is VALID [2018-11-23 12:54:34,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {3386#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3419#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:34,324 INFO L273 TraceCheckUtils]: 6: Hoare triple {3419#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3419#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:34,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {3419#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3389#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:34,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {3389#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3389#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:34,326 INFO L273 TraceCheckUtils]: 9: Hoare triple {3389#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3390#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:34,327 INFO L273 TraceCheckUtils]: 10: Hoare triple {3390#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3390#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:34,328 INFO L273 TraceCheckUtils]: 11: Hoare triple {3390#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3391#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:34,328 INFO L273 TraceCheckUtils]: 12: Hoare triple {3391#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3391#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:34,329 INFO L273 TraceCheckUtils]: 13: Hoare triple {3391#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3392#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:34,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {3392#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3392#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:34,330 INFO L273 TraceCheckUtils]: 15: Hoare triple {3392#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3393#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:34,331 INFO L273 TraceCheckUtils]: 16: Hoare triple {3393#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3393#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:34,332 INFO L273 TraceCheckUtils]: 17: Hoare triple {3393#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3394#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:34,332 INFO L273 TraceCheckUtils]: 18: Hoare triple {3394#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3394#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:34,333 INFO L273 TraceCheckUtils]: 19: Hoare triple {3394#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3395#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:34,334 INFO L273 TraceCheckUtils]: 20: Hoare triple {3395#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3395#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:34,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {3395#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3396#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:34,335 INFO L273 TraceCheckUtils]: 22: Hoare triple {3396#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3396#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:34,336 INFO L273 TraceCheckUtils]: 23: Hoare triple {3396#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3397#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:34,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {3397#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3397#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:34,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {3397#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3398#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:34,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {3398#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3398#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:34,339 INFO L273 TraceCheckUtils]: 27: Hoare triple {3398#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3399#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:34,340 INFO L273 TraceCheckUtils]: 28: Hoare triple {3399#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3399#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:34,341 INFO L273 TraceCheckUtils]: 29: Hoare triple {3399#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3400#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:34,342 INFO L273 TraceCheckUtils]: 30: Hoare triple {3400#(<= main_~j~0 12)} assume !(~j~0 < 20); {3387#false} is VALID [2018-11-23 12:54:34,342 INFO L273 TraceCheckUtils]: 31: Hoare triple {3387#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3387#false} is VALID [2018-11-23 12:54:34,342 INFO L273 TraceCheckUtils]: 32: Hoare triple {3387#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3387#false} is VALID [2018-11-23 12:54:34,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {3387#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3387#false} is VALID [2018-11-23 12:54:34,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {3387#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3387#false} is VALID [2018-11-23 12:54:34,343 INFO L256 TraceCheckUtils]: 35: Hoare triple {3387#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3387#false} is VALID [2018-11-23 12:54:34,343 INFO L273 TraceCheckUtils]: 36: Hoare triple {3387#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3387#false} is VALID [2018-11-23 12:54:34,343 INFO L273 TraceCheckUtils]: 37: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-23 12:54:34,344 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3387#false} {3387#false} #57#return; {3387#false} is VALID [2018-11-23 12:54:34,344 INFO L273 TraceCheckUtils]: 39: Hoare triple {3387#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3387#false} is VALID [2018-11-23 12:54:34,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {3387#false} assume 0 == #t~ret8;havoc #t~ret8; {3387#false} is VALID [2018-11-23 12:54:34,345 INFO L273 TraceCheckUtils]: 41: Hoare triple {3387#false} assume !false; {3387#false} is VALID [2018-11-23 12:54:34,348 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:34,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:34,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:54:34,381 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-23 12:54:34,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:34,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:54:34,510 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:34,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:54:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:54:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:54:34,512 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 16 states. [2018-11-23 12:54:34,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:34,868 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:54:34,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:54:34,868 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-23 12:54:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:54:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-23 12:54:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:54:34,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-23 12:54:34,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2018-11-23 12:54:34,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:34,994 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:54:34,995 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:54:34,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:54:34,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:54:35,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 12:54:35,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:35,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 45 states. [2018-11-23 12:54:35,014 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 45 states. [2018-11-23 12:54:35,014 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 45 states. [2018-11-23 12:54:35,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,016 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:54:35,016 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:54:35,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:35,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:35,016 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 46 states. [2018-11-23 12:54:35,017 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 46 states. [2018-11-23 12:54:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,018 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:54:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:54:35,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:35,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:35,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:35,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:35,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:54:35,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:54:35,020 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-11-23 12:54:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:35,020 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:54:35,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:54:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:54:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:54:35,021 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:35,021 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:35,022 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:35,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:35,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2018-11-23 12:54:35,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:35,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:35,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:35,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:35,252 INFO L256 TraceCheckUtils]: 0: Hoare triple {3770#true} call ULTIMATE.init(); {3770#true} is VALID [2018-11-23 12:54:35,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {3770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3770#true} is VALID [2018-11-23 12:54:35,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {3770#true} assume true; {3770#true} is VALID [2018-11-23 12:54:35,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3770#true} {3770#true} #53#return; {3770#true} is VALID [2018-11-23 12:54:35,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {3770#true} call #t~ret9 := main(); {3770#true} is VALID [2018-11-23 12:54:35,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {3770#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3772#(= main_~j~0 0)} is VALID [2018-11-23 12:54:35,253 INFO L273 TraceCheckUtils]: 6: Hoare triple {3772#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3772#(= main_~j~0 0)} is VALID [2018-11-23 12:54:35,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {3772#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3773#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:35,254 INFO L273 TraceCheckUtils]: 8: Hoare triple {3773#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3773#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:35,255 INFO L273 TraceCheckUtils]: 9: Hoare triple {3773#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3774#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:35,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {3774#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3774#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:35,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {3774#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3775#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:35,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {3775#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3775#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:35,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {3775#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3776#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:35,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {3776#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3776#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:35,258 INFO L273 TraceCheckUtils]: 15: Hoare triple {3776#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3777#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:35,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {3777#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3777#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:35,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {3777#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3778#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:35,260 INFO L273 TraceCheckUtils]: 18: Hoare triple {3778#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3778#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:35,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {3778#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3779#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:35,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {3779#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3779#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:35,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {3779#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3780#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:35,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {3780#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3780#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:35,264 INFO L273 TraceCheckUtils]: 23: Hoare triple {3780#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3781#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:35,264 INFO L273 TraceCheckUtils]: 24: Hoare triple {3781#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3781#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:35,265 INFO L273 TraceCheckUtils]: 25: Hoare triple {3781#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3782#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:35,266 INFO L273 TraceCheckUtils]: 26: Hoare triple {3782#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3782#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:35,267 INFO L273 TraceCheckUtils]: 27: Hoare triple {3782#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3783#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:35,267 INFO L273 TraceCheckUtils]: 28: Hoare triple {3783#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3783#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:35,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {3783#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3784#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:35,268 INFO L273 TraceCheckUtils]: 30: Hoare triple {3784#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3784#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:35,269 INFO L273 TraceCheckUtils]: 31: Hoare triple {3784#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3785#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:35,270 INFO L273 TraceCheckUtils]: 32: Hoare triple {3785#(<= main_~j~0 13)} assume !(~j~0 < 20); {3771#false} is VALID [2018-11-23 12:54:35,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {3771#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3771#false} is VALID [2018-11-23 12:54:35,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {3771#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3771#false} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {3771#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3771#false} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 36: Hoare triple {3771#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3771#false} is VALID [2018-11-23 12:54:35,271 INFO L256 TraceCheckUtils]: 37: Hoare triple {3771#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3770#true} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 38: Hoare triple {3770#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3770#true} is VALID [2018-11-23 12:54:35,271 INFO L273 TraceCheckUtils]: 39: Hoare triple {3770#true} assume true; {3770#true} is VALID [2018-11-23 12:54:35,272 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3770#true} {3771#false} #57#return; {3771#false} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 41: Hoare triple {3771#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3771#false} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 42: Hoare triple {3771#false} assume 0 == #t~ret8;havoc #t~ret8; {3771#false} is VALID [2018-11-23 12:54:35,272 INFO L273 TraceCheckUtils]: 43: Hoare triple {3771#false} assume !false; {3771#false} is VALID [2018-11-23 12:54:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:35,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:35,274 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:35,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:35,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:35,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:35,465 INFO L256 TraceCheckUtils]: 0: Hoare triple {3770#true} call ULTIMATE.init(); {3770#true} is VALID [2018-11-23 12:54:35,465 INFO L273 TraceCheckUtils]: 1: Hoare triple {3770#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3770#true} is VALID [2018-11-23 12:54:35,465 INFO L273 TraceCheckUtils]: 2: Hoare triple {3770#true} assume true; {3770#true} is VALID [2018-11-23 12:54:35,465 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3770#true} {3770#true} #53#return; {3770#true} is VALID [2018-11-23 12:54:35,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {3770#true} call #t~ret9 := main(); {3770#true} is VALID [2018-11-23 12:54:35,466 INFO L273 TraceCheckUtils]: 5: Hoare triple {3770#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {3804#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:35,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {3804#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3804#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:35,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {3804#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3773#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:35,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {3773#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3773#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:35,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {3773#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3774#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:35,468 INFO L273 TraceCheckUtils]: 10: Hoare triple {3774#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3774#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:35,468 INFO L273 TraceCheckUtils]: 11: Hoare triple {3774#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3775#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:35,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {3775#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3775#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:35,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {3775#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3776#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:35,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {3776#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3776#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:35,470 INFO L273 TraceCheckUtils]: 15: Hoare triple {3776#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3777#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:35,471 INFO L273 TraceCheckUtils]: 16: Hoare triple {3777#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3777#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:35,471 INFO L273 TraceCheckUtils]: 17: Hoare triple {3777#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3778#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:35,472 INFO L273 TraceCheckUtils]: 18: Hoare triple {3778#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3778#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:35,473 INFO L273 TraceCheckUtils]: 19: Hoare triple {3778#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3779#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:35,473 INFO L273 TraceCheckUtils]: 20: Hoare triple {3779#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3779#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:35,474 INFO L273 TraceCheckUtils]: 21: Hoare triple {3779#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3780#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:35,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {3780#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3780#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:35,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {3780#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3781#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:35,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {3781#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3781#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:35,476 INFO L273 TraceCheckUtils]: 25: Hoare triple {3781#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3782#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:35,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {3782#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3782#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:35,478 INFO L273 TraceCheckUtils]: 27: Hoare triple {3782#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3783#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:35,478 INFO L273 TraceCheckUtils]: 28: Hoare triple {3783#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3783#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:35,479 INFO L273 TraceCheckUtils]: 29: Hoare triple {3783#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3784#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:35,480 INFO L273 TraceCheckUtils]: 30: Hoare triple {3784#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {3784#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:35,480 INFO L273 TraceCheckUtils]: 31: Hoare triple {3784#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {3785#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:35,481 INFO L273 TraceCheckUtils]: 32: Hoare triple {3785#(<= main_~j~0 13)} assume !(~j~0 < 20); {3771#false} is VALID [2018-11-23 12:54:35,481 INFO L273 TraceCheckUtils]: 33: Hoare triple {3771#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {3771#false} is VALID [2018-11-23 12:54:35,482 INFO L273 TraceCheckUtils]: 34: Hoare triple {3771#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {3771#false} is VALID [2018-11-23 12:54:35,482 INFO L273 TraceCheckUtils]: 35: Hoare triple {3771#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {3771#false} is VALID [2018-11-23 12:54:35,482 INFO L273 TraceCheckUtils]: 36: Hoare triple {3771#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {3771#false} is VALID [2018-11-23 12:54:35,482 INFO L256 TraceCheckUtils]: 37: Hoare triple {3771#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {3771#false} is VALID [2018-11-23 12:54:35,482 INFO L273 TraceCheckUtils]: 38: Hoare triple {3771#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {3771#false} is VALID [2018-11-23 12:54:35,483 INFO L273 TraceCheckUtils]: 39: Hoare triple {3771#false} assume true; {3771#false} is VALID [2018-11-23 12:54:35,483 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {3771#false} {3771#false} #57#return; {3771#false} is VALID [2018-11-23 12:54:35,483 INFO L273 TraceCheckUtils]: 41: Hoare triple {3771#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {3771#false} is VALID [2018-11-23 12:54:35,483 INFO L273 TraceCheckUtils]: 42: Hoare triple {3771#false} assume 0 == #t~ret8;havoc #t~ret8; {3771#false} is VALID [2018-11-23 12:54:35,483 INFO L273 TraceCheckUtils]: 43: Hoare triple {3771#false} assume !false; {3771#false} is VALID [2018-11-23 12:54:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:35,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:35,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:54:35,508 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-23 12:54:35,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:35,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:54:35,559 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:35,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:54:35,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:54:35,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:54:35,560 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-11-23 12:54:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:35,842 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:54:35,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:54:35,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-23 12:54:35,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:35,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:54:35,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-23 12:54:35,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:54:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-23 12:54:35,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 62 transitions. [2018-11-23 12:54:36,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:36,245 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:54:36,245 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:54:36,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:54:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:54:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 12:54:36,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:36,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2018-11-23 12:54:36,265 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2018-11-23 12:54:36,265 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2018-11-23 12:54:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,267 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 12:54:36,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:54:36,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:36,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:36,267 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2018-11-23 12:54:36,267 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2018-11-23 12:54:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:36,268 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 12:54:36,269 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:54:36,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:36,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:36,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:36,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:36,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:54:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 12:54:36,270 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-11-23 12:54:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:36,270 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 12:54:36,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:54:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:54:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:54:36,271 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:36,271 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:36,272 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:36,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:36,272 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2018-11-23 12:54:36,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:36,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:36,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:36,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:36,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:37,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {4171#true} call ULTIMATE.init(); {4171#true} is VALID [2018-11-23 12:54:37,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {4171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4171#true} is VALID [2018-11-23 12:54:37,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {4171#true} assume true; {4171#true} is VALID [2018-11-23 12:54:37,157 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4171#true} {4171#true} #53#return; {4171#true} is VALID [2018-11-23 12:54:37,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {4171#true} call #t~ret9 := main(); {4171#true} is VALID [2018-11-23 12:54:37,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {4171#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4173#(= main_~j~0 0)} is VALID [2018-11-23 12:54:37,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {4173#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4173#(= main_~j~0 0)} is VALID [2018-11-23 12:54:37,159 INFO L273 TraceCheckUtils]: 7: Hoare triple {4173#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4174#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,159 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4174#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {4174#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4175#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {4175#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4175#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {4175#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4176#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {4176#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4176#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {4176#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4177#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,162 INFO L273 TraceCheckUtils]: 14: Hoare triple {4177#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4177#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {4177#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4178#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {4178#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4178#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {4178#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4179#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,165 INFO L273 TraceCheckUtils]: 18: Hoare triple {4179#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4179#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {4179#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4180#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:37,166 INFO L273 TraceCheckUtils]: 20: Hoare triple {4180#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4180#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:37,167 INFO L273 TraceCheckUtils]: 21: Hoare triple {4180#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4181#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:37,173 INFO L273 TraceCheckUtils]: 22: Hoare triple {4181#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4181#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:37,174 INFO L273 TraceCheckUtils]: 23: Hoare triple {4181#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4182#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:37,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {4182#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4182#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:37,174 INFO L273 TraceCheckUtils]: 25: Hoare triple {4182#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4183#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:37,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {4183#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4183#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:37,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {4183#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4184#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:37,176 INFO L273 TraceCheckUtils]: 28: Hoare triple {4184#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4184#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:37,176 INFO L273 TraceCheckUtils]: 29: Hoare triple {4184#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4185#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:37,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {4185#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4185#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:37,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {4185#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4186#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:37,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {4186#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4186#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:37,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {4186#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4187#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:37,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {4187#(<= main_~j~0 14)} assume !(~j~0 < 20); {4172#false} is VALID [2018-11-23 12:54:37,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {4172#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4172#false} is VALID [2018-11-23 12:54:37,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {4172#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4172#false} is VALID [2018-11-23 12:54:37,179 INFO L273 TraceCheckUtils]: 37: Hoare triple {4172#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4172#false} is VALID [2018-11-23 12:54:37,179 INFO L273 TraceCheckUtils]: 38: Hoare triple {4172#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4172#false} is VALID [2018-11-23 12:54:37,180 INFO L256 TraceCheckUtils]: 39: Hoare triple {4172#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4171#true} is VALID [2018-11-23 12:54:37,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {4171#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4171#true} is VALID [2018-11-23 12:54:37,180 INFO L273 TraceCheckUtils]: 41: Hoare triple {4171#true} assume true; {4171#true} is VALID [2018-11-23 12:54:37,180 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4171#true} {4172#false} #57#return; {4172#false} is VALID [2018-11-23 12:54:37,180 INFO L273 TraceCheckUtils]: 43: Hoare triple {4172#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4172#false} is VALID [2018-11-23 12:54:37,181 INFO L273 TraceCheckUtils]: 44: Hoare triple {4172#false} assume 0 == #t~ret8;havoc #t~ret8; {4172#false} is VALID [2018-11-23 12:54:37,181 INFO L273 TraceCheckUtils]: 45: Hoare triple {4172#false} assume !false; {4172#false} is VALID [2018-11-23 12:54:37,183 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:37,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:37,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:37,192 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:54:37,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:54:37,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:37,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:37,353 INFO L256 TraceCheckUtils]: 0: Hoare triple {4171#true} call ULTIMATE.init(); {4171#true} is VALID [2018-11-23 12:54:37,353 INFO L273 TraceCheckUtils]: 1: Hoare triple {4171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4171#true} is VALID [2018-11-23 12:54:37,354 INFO L273 TraceCheckUtils]: 2: Hoare triple {4171#true} assume true; {4171#true} is VALID [2018-11-23 12:54:37,354 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4171#true} {4171#true} #53#return; {4171#true} is VALID [2018-11-23 12:54:37,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {4171#true} call #t~ret9 := main(); {4171#true} is VALID [2018-11-23 12:54:37,355 INFO L273 TraceCheckUtils]: 5: Hoare triple {4171#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4206#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:37,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {4206#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4206#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:37,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {4206#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4174#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {4174#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4174#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:37,356 INFO L273 TraceCheckUtils]: 9: Hoare triple {4174#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4175#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {4175#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4175#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:37,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {4175#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4176#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {4176#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4176#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:37,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {4176#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4177#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {4177#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4177#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:37,360 INFO L273 TraceCheckUtils]: 15: Hoare triple {4177#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4178#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {4178#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4178#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:37,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {4178#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4179#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {4179#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4179#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:37,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {4179#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4180#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:37,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {4180#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4180#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:37,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {4180#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4181#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:37,365 INFO L273 TraceCheckUtils]: 22: Hoare triple {4181#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4181#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:37,365 INFO L273 TraceCheckUtils]: 23: Hoare triple {4181#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4182#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:37,366 INFO L273 TraceCheckUtils]: 24: Hoare triple {4182#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4182#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:37,367 INFO L273 TraceCheckUtils]: 25: Hoare triple {4182#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4183#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:37,367 INFO L273 TraceCheckUtils]: 26: Hoare triple {4183#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4183#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:37,368 INFO L273 TraceCheckUtils]: 27: Hoare triple {4183#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4184#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:37,369 INFO L273 TraceCheckUtils]: 28: Hoare triple {4184#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4184#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:37,369 INFO L273 TraceCheckUtils]: 29: Hoare triple {4184#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4185#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:37,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {4185#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4185#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:37,371 INFO L273 TraceCheckUtils]: 31: Hoare triple {4185#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4186#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:37,371 INFO L273 TraceCheckUtils]: 32: Hoare triple {4186#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4186#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:37,372 INFO L273 TraceCheckUtils]: 33: Hoare triple {4186#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4187#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:37,373 INFO L273 TraceCheckUtils]: 34: Hoare triple {4187#(<= main_~j~0 14)} assume !(~j~0 < 20); {4172#false} is VALID [2018-11-23 12:54:37,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {4172#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4172#false} is VALID [2018-11-23 12:54:37,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {4172#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4172#false} is VALID [2018-11-23 12:54:37,373 INFO L273 TraceCheckUtils]: 37: Hoare triple {4172#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4172#false} is VALID [2018-11-23 12:54:37,373 INFO L273 TraceCheckUtils]: 38: Hoare triple {4172#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4172#false} is VALID [2018-11-23 12:54:37,374 INFO L256 TraceCheckUtils]: 39: Hoare triple {4172#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4172#false} is VALID [2018-11-23 12:54:37,374 INFO L273 TraceCheckUtils]: 40: Hoare triple {4172#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4172#false} is VALID [2018-11-23 12:54:37,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {4172#false} assume true; {4172#false} is VALID [2018-11-23 12:54:37,374 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4172#false} {4172#false} #57#return; {4172#false} is VALID [2018-11-23 12:54:37,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {4172#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4172#false} is VALID [2018-11-23 12:54:37,375 INFO L273 TraceCheckUtils]: 44: Hoare triple {4172#false} assume 0 == #t~ret8;havoc #t~ret8; {4172#false} is VALID [2018-11-23 12:54:37,375 INFO L273 TraceCheckUtils]: 45: Hoare triple {4172#false} assume !false; {4172#false} is VALID [2018-11-23 12:54:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:37,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:37,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:54:37,397 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-11-23 12:54:37,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:37,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:54:37,451 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,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:54:37,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:54:37,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:54:37,452 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2018-11-23 12:54:37,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:37,789 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 12:54:37,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:54:37,790 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-11-23 12:54:37,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:37,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:54:37,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-23 12:54:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:54:37,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-23 12:54:37,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 64 transitions. [2018-11-23 12:54:38,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:38,273 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:54:38,274 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:54:38,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:54:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:54:38,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 12:54:38,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:38,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-23 12:54:38,293 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-23 12:54:38,294 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-23 12:54:38,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,295 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 12:54:38,295 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:54:38,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,295 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-23 12:54:38,296 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-23 12:54:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:38,297 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 12:54:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:54:38,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:38,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:38,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:38,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:38,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:54:38,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 12:54:38,298 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-11-23 12:54:38,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:38,299 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 12:54:38,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:54:38,299 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:54:38,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:54:38,300 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:38,300 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:38,300 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:38,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:38,300 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2018-11-23 12:54:38,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:38,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:38,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:38,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:38,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:39,099 INFO L256 TraceCheckUtils]: 0: Hoare triple {4589#true} call ULTIMATE.init(); {4589#true} is VALID [2018-11-23 12:54:39,100 INFO L273 TraceCheckUtils]: 1: Hoare triple {4589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4589#true} is VALID [2018-11-23 12:54:39,100 INFO L273 TraceCheckUtils]: 2: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:54:39,100 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4589#true} {4589#true} #53#return; {4589#true} is VALID [2018-11-23 12:54:39,100 INFO L256 TraceCheckUtils]: 4: Hoare triple {4589#true} call #t~ret9 := main(); {4589#true} is VALID [2018-11-23 12:54:39,101 INFO L273 TraceCheckUtils]: 5: Hoare triple {4589#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4591#(= main_~j~0 0)} is VALID [2018-11-23 12:54:39,101 INFO L273 TraceCheckUtils]: 6: Hoare triple {4591#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4591#(= main_~j~0 0)} is VALID [2018-11-23 12:54:39,102 INFO L273 TraceCheckUtils]: 7: Hoare triple {4591#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4592#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:39,102 INFO L273 TraceCheckUtils]: 8: Hoare triple {4592#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4592#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:39,102 INFO L273 TraceCheckUtils]: 9: Hoare triple {4592#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4593#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:39,103 INFO L273 TraceCheckUtils]: 10: Hoare triple {4593#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4593#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:39,103 INFO L273 TraceCheckUtils]: 11: Hoare triple {4593#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4594#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:39,104 INFO L273 TraceCheckUtils]: 12: Hoare triple {4594#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4594#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:39,105 INFO L273 TraceCheckUtils]: 13: Hoare triple {4594#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4595#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:39,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {4595#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4595#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:39,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {4595#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4596#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:39,107 INFO L273 TraceCheckUtils]: 16: Hoare triple {4596#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4596#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:39,107 INFO L273 TraceCheckUtils]: 17: Hoare triple {4596#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4597#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:39,108 INFO L273 TraceCheckUtils]: 18: Hoare triple {4597#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4597#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:39,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {4597#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4598#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:39,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {4598#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4598#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:39,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {4598#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4599#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:39,111 INFO L273 TraceCheckUtils]: 22: Hoare triple {4599#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4599#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:39,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {4599#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4600#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:39,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {4600#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4600#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:39,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {4600#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4601#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:39,113 INFO L273 TraceCheckUtils]: 26: Hoare triple {4601#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4601#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:39,114 INFO L273 TraceCheckUtils]: 27: Hoare triple {4601#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4602#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:39,114 INFO L273 TraceCheckUtils]: 28: Hoare triple {4602#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4602#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:39,115 INFO L273 TraceCheckUtils]: 29: Hoare triple {4602#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4603#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:39,116 INFO L273 TraceCheckUtils]: 30: Hoare triple {4603#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4603#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:39,117 INFO L273 TraceCheckUtils]: 31: Hoare triple {4603#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4604#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:39,117 INFO L273 TraceCheckUtils]: 32: Hoare triple {4604#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4604#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:39,118 INFO L273 TraceCheckUtils]: 33: Hoare triple {4604#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4605#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:39,118 INFO L273 TraceCheckUtils]: 34: Hoare triple {4605#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4605#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:39,119 INFO L273 TraceCheckUtils]: 35: Hoare triple {4605#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4606#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:39,120 INFO L273 TraceCheckUtils]: 36: Hoare triple {4606#(<= main_~j~0 15)} assume !(~j~0 < 20); {4590#false} is VALID [2018-11-23 12:54:39,120 INFO L273 TraceCheckUtils]: 37: Hoare triple {4590#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4590#false} is VALID [2018-11-23 12:54:39,120 INFO L273 TraceCheckUtils]: 38: Hoare triple {4590#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4590#false} is VALID [2018-11-23 12:54:39,121 INFO L273 TraceCheckUtils]: 39: Hoare triple {4590#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4590#false} is VALID [2018-11-23 12:54:39,121 INFO L273 TraceCheckUtils]: 40: Hoare triple {4590#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4590#false} is VALID [2018-11-23 12:54:39,121 INFO L256 TraceCheckUtils]: 41: Hoare triple {4590#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4589#true} is VALID [2018-11-23 12:54:39,121 INFO L273 TraceCheckUtils]: 42: Hoare triple {4589#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4589#true} is VALID [2018-11-23 12:54:39,121 INFO L273 TraceCheckUtils]: 43: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:54:39,122 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4589#true} {4590#false} #57#return; {4590#false} is VALID [2018-11-23 12:54:39,122 INFO L273 TraceCheckUtils]: 45: Hoare triple {4590#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4590#false} is VALID [2018-11-23 12:54:39,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {4590#false} assume 0 == #t~ret8;havoc #t~ret8; {4590#false} is VALID [2018-11-23 12:54:39,122 INFO L273 TraceCheckUtils]: 47: Hoare triple {4590#false} assume !false; {4590#false} is VALID [2018-11-23 12:54:39,125 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:39,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:39,125 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:39,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:54:40,786 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 12:54:40,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:40,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:40,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {4589#true} call ULTIMATE.init(); {4589#true} is VALID [2018-11-23 12:54:40,989 INFO L273 TraceCheckUtils]: 1: Hoare triple {4589#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4589#true} is VALID [2018-11-23 12:54:40,989 INFO L273 TraceCheckUtils]: 2: Hoare triple {4589#true} assume true; {4589#true} is VALID [2018-11-23 12:54:40,990 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4589#true} {4589#true} #53#return; {4589#true} is VALID [2018-11-23 12:54:40,990 INFO L256 TraceCheckUtils]: 4: Hoare triple {4589#true} call #t~ret9 := main(); {4589#true} is VALID [2018-11-23 12:54:40,991 INFO L273 TraceCheckUtils]: 5: Hoare triple {4589#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {4625#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:40,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {4625#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4625#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:40,992 INFO L273 TraceCheckUtils]: 7: Hoare triple {4625#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4592#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:40,992 INFO L273 TraceCheckUtils]: 8: Hoare triple {4592#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4592#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:40,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {4592#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4593#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:40,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {4593#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4593#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:40,993 INFO L273 TraceCheckUtils]: 11: Hoare triple {4593#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4594#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:40,994 INFO L273 TraceCheckUtils]: 12: Hoare triple {4594#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4594#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:40,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {4594#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4595#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:40,997 INFO L273 TraceCheckUtils]: 14: Hoare triple {4595#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4595#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:40,998 INFO L273 TraceCheckUtils]: 15: Hoare triple {4595#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4596#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:40,998 INFO L273 TraceCheckUtils]: 16: Hoare triple {4596#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4596#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:40,999 INFO L273 TraceCheckUtils]: 17: Hoare triple {4596#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4597#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:41,005 INFO L273 TraceCheckUtils]: 18: Hoare triple {4597#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4597#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:41,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {4597#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4598#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:41,007 INFO L273 TraceCheckUtils]: 20: Hoare triple {4598#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4598#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:41,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {4598#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4599#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:41,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {4599#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4599#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:41,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {4599#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4600#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:41,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {4600#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4600#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:41,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {4600#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4601#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:41,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {4601#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4601#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:41,017 INFO L273 TraceCheckUtils]: 27: Hoare triple {4601#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4602#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:41,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {4602#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4602#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:41,022 INFO L273 TraceCheckUtils]: 29: Hoare triple {4602#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4603#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:41,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {4603#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4603#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:41,024 INFO L273 TraceCheckUtils]: 31: Hoare triple {4603#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4604#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:41,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {4604#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4604#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:41,026 INFO L273 TraceCheckUtils]: 33: Hoare triple {4604#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4605#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:41,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {4605#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {4605#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:41,028 INFO L273 TraceCheckUtils]: 35: Hoare triple {4605#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {4606#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:41,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {4606#(<= main_~j~0 15)} assume !(~j~0 < 20); {4590#false} is VALID [2018-11-23 12:54:41,030 INFO L273 TraceCheckUtils]: 37: Hoare triple {4590#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {4590#false} is VALID [2018-11-23 12:54:41,030 INFO L273 TraceCheckUtils]: 38: Hoare triple {4590#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {4590#false} is VALID [2018-11-23 12:54:41,030 INFO L273 TraceCheckUtils]: 39: Hoare triple {4590#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {4590#false} is VALID [2018-11-23 12:54:41,030 INFO L273 TraceCheckUtils]: 40: Hoare triple {4590#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {4590#false} is VALID [2018-11-23 12:54:41,030 INFO L256 TraceCheckUtils]: 41: Hoare triple {4590#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {4590#false} is VALID [2018-11-23 12:54:41,030 INFO L273 TraceCheckUtils]: 42: Hoare triple {4590#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {4590#false} is VALID [2018-11-23 12:54:41,031 INFO L273 TraceCheckUtils]: 43: Hoare triple {4590#false} assume true; {4590#false} is VALID [2018-11-23 12:54:41,031 INFO L268 TraceCheckUtils]: 44: Hoare quadruple {4590#false} {4590#false} #57#return; {4590#false} is VALID [2018-11-23 12:54:41,031 INFO L273 TraceCheckUtils]: 45: Hoare triple {4590#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {4590#false} is VALID [2018-11-23 12:54:41,031 INFO L273 TraceCheckUtils]: 46: Hoare triple {4590#false} assume 0 == #t~ret8;havoc #t~ret8; {4590#false} is VALID [2018-11-23 12:54:41,031 INFO L273 TraceCheckUtils]: 47: Hoare triple {4590#false} assume !false; {4590#false} is VALID [2018-11-23 12:54:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:41,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:41,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:54:41,054 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-23 12:54:41,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:41,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:54:41,134 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:41,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:54:41,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:54:41,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:54:41,135 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2018-11-23 12:54:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:41,703 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:54:41,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:54:41,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-23 12:54:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:41,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:54:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2018-11-23 12:54:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:54:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2018-11-23 12:54:41,707 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2018-11-23 12:54:42,566 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,567 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:54:42,567 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:54:42,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:54:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:54:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 12:54:42,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:42,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2018-11-23 12:54:42,665 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2018-11-23 12:54:42,665 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2018-11-23 12:54:42,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:42,666 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:54:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:54:42,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:42,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:42,667 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2018-11-23 12:54:42,667 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2018-11-23 12:54:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:42,668 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:54:42,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:54:42,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:42,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:42,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:42,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:54:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 12:54:42,669 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-11-23 12:54:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:42,670 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 12:54:42,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:54:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:54:42,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:54:42,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:42,671 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:42,671 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:42,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2018-11-23 12:54:42,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:42,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:42,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:43,360 INFO L256 TraceCheckUtils]: 0: Hoare triple {5024#true} call ULTIMATE.init(); {5024#true} is VALID [2018-11-23 12:54:43,360 INFO L273 TraceCheckUtils]: 1: Hoare triple {5024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5024#true} is VALID [2018-11-23 12:54:43,360 INFO L273 TraceCheckUtils]: 2: Hoare triple {5024#true} assume true; {5024#true} is VALID [2018-11-23 12:54:43,360 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5024#true} {5024#true} #53#return; {5024#true} is VALID [2018-11-23 12:54:43,361 INFO L256 TraceCheckUtils]: 4: Hoare triple {5024#true} call #t~ret9 := main(); {5024#true} is VALID [2018-11-23 12:54:43,361 INFO L273 TraceCheckUtils]: 5: Hoare triple {5024#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5026#(= main_~j~0 0)} is VALID [2018-11-23 12:54:43,362 INFO L273 TraceCheckUtils]: 6: Hoare triple {5026#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5026#(= main_~j~0 0)} is VALID [2018-11-23 12:54:43,363 INFO L273 TraceCheckUtils]: 7: Hoare triple {5026#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5027#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:43,363 INFO L273 TraceCheckUtils]: 8: Hoare triple {5027#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5027#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:43,364 INFO L273 TraceCheckUtils]: 9: Hoare triple {5027#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5028#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:43,365 INFO L273 TraceCheckUtils]: 10: Hoare triple {5028#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5028#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:43,365 INFO L273 TraceCheckUtils]: 11: Hoare triple {5028#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5029#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:43,366 INFO L273 TraceCheckUtils]: 12: Hoare triple {5029#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5029#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:43,367 INFO L273 TraceCheckUtils]: 13: Hoare triple {5029#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5030#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:43,367 INFO L273 TraceCheckUtils]: 14: Hoare triple {5030#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5030#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:43,368 INFO L273 TraceCheckUtils]: 15: Hoare triple {5030#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5031#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:43,369 INFO L273 TraceCheckUtils]: 16: Hoare triple {5031#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5031#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:43,369 INFO L273 TraceCheckUtils]: 17: Hoare triple {5031#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5032#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:43,370 INFO L273 TraceCheckUtils]: 18: Hoare triple {5032#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5032#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:43,371 INFO L273 TraceCheckUtils]: 19: Hoare triple {5032#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5033#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:43,371 INFO L273 TraceCheckUtils]: 20: Hoare triple {5033#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5033#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:43,372 INFO L273 TraceCheckUtils]: 21: Hoare triple {5033#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5034#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:43,373 INFO L273 TraceCheckUtils]: 22: Hoare triple {5034#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5034#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:43,373 INFO L273 TraceCheckUtils]: 23: Hoare triple {5034#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5035#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:43,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {5035#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5035#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:43,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {5035#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5036#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:43,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {5036#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5036#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:43,376 INFO L273 TraceCheckUtils]: 27: Hoare triple {5036#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5037#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:43,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {5037#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5037#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:43,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {5037#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5038#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:43,378 INFO L273 TraceCheckUtils]: 30: Hoare triple {5038#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5038#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:43,379 INFO L273 TraceCheckUtils]: 31: Hoare triple {5038#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5039#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:43,379 INFO L273 TraceCheckUtils]: 32: Hoare triple {5039#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5039#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:43,380 INFO L273 TraceCheckUtils]: 33: Hoare triple {5039#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5040#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:43,381 INFO L273 TraceCheckUtils]: 34: Hoare triple {5040#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5040#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:43,382 INFO L273 TraceCheckUtils]: 35: Hoare triple {5040#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5041#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:43,382 INFO L273 TraceCheckUtils]: 36: Hoare triple {5041#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5041#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:43,383 INFO L273 TraceCheckUtils]: 37: Hoare triple {5041#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5042#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:43,384 INFO L273 TraceCheckUtils]: 38: Hoare triple {5042#(<= main_~j~0 16)} assume !(~j~0 < 20); {5025#false} is VALID [2018-11-23 12:54:43,384 INFO L273 TraceCheckUtils]: 39: Hoare triple {5025#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5025#false} is VALID [2018-11-23 12:54:43,384 INFO L273 TraceCheckUtils]: 40: Hoare triple {5025#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5025#false} is VALID [2018-11-23 12:54:43,384 INFO L273 TraceCheckUtils]: 41: Hoare triple {5025#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5025#false} is VALID [2018-11-23 12:54:43,385 INFO L273 TraceCheckUtils]: 42: Hoare triple {5025#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5025#false} is VALID [2018-11-23 12:54:43,385 INFO L256 TraceCheckUtils]: 43: Hoare triple {5025#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5024#true} is VALID [2018-11-23 12:54:43,385 INFO L273 TraceCheckUtils]: 44: Hoare triple {5024#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5024#true} is VALID [2018-11-23 12:54:43,385 INFO L273 TraceCheckUtils]: 45: Hoare triple {5024#true} assume true; {5024#true} is VALID [2018-11-23 12:54:43,385 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5024#true} {5025#false} #57#return; {5025#false} is VALID [2018-11-23 12:54:43,386 INFO L273 TraceCheckUtils]: 47: Hoare triple {5025#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5025#false} is VALID [2018-11-23 12:54:43,386 INFO L273 TraceCheckUtils]: 48: Hoare triple {5025#false} assume 0 == #t~ret8;havoc #t~ret8; {5025#false} is VALID [2018-11-23 12:54:43,386 INFO L273 TraceCheckUtils]: 49: Hoare triple {5025#false} assume !false; {5025#false} is VALID [2018-11-23 12:54:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:43,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:43,388 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:43,397 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:54:43,431 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:54:43,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:43,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:43,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:43,650 INFO L256 TraceCheckUtils]: 0: Hoare triple {5024#true} call ULTIMATE.init(); {5024#true} is VALID [2018-11-23 12:54:43,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {5024#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5024#true} is VALID [2018-11-23 12:54:43,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {5024#true} assume true; {5024#true} is VALID [2018-11-23 12:54:43,651 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5024#true} {5024#true} #53#return; {5024#true} is VALID [2018-11-23 12:54:43,651 INFO L256 TraceCheckUtils]: 4: Hoare triple {5024#true} call #t~ret9 := main(); {5024#true} is VALID [2018-11-23 12:54:43,652 INFO L273 TraceCheckUtils]: 5: Hoare triple {5024#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5061#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:43,652 INFO L273 TraceCheckUtils]: 6: Hoare triple {5061#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5061#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:43,653 INFO L273 TraceCheckUtils]: 7: Hoare triple {5061#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5027#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:43,653 INFO L273 TraceCheckUtils]: 8: Hoare triple {5027#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5027#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:43,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {5027#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5028#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:43,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {5028#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5028#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:43,654 INFO L273 TraceCheckUtils]: 11: Hoare triple {5028#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5029#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:43,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {5029#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5029#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:43,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {5029#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5030#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:43,656 INFO L273 TraceCheckUtils]: 14: Hoare triple {5030#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5030#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:43,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {5030#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5031#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:43,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {5031#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5031#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:43,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {5031#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5032#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:43,658 INFO L273 TraceCheckUtils]: 18: Hoare triple {5032#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5032#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:43,659 INFO L273 TraceCheckUtils]: 19: Hoare triple {5032#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5033#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:43,660 INFO L273 TraceCheckUtils]: 20: Hoare triple {5033#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5033#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:43,660 INFO L273 TraceCheckUtils]: 21: Hoare triple {5033#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5034#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:43,661 INFO L273 TraceCheckUtils]: 22: Hoare triple {5034#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5034#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:43,662 INFO L273 TraceCheckUtils]: 23: Hoare triple {5034#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5035#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:43,662 INFO L273 TraceCheckUtils]: 24: Hoare triple {5035#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5035#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:43,663 INFO L273 TraceCheckUtils]: 25: Hoare triple {5035#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5036#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:43,664 INFO L273 TraceCheckUtils]: 26: Hoare triple {5036#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5036#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:43,664 INFO L273 TraceCheckUtils]: 27: Hoare triple {5036#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5037#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:43,665 INFO L273 TraceCheckUtils]: 28: Hoare triple {5037#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5037#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:43,666 INFO L273 TraceCheckUtils]: 29: Hoare triple {5037#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5038#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:43,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {5038#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5038#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:43,667 INFO L273 TraceCheckUtils]: 31: Hoare triple {5038#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5039#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:43,668 INFO L273 TraceCheckUtils]: 32: Hoare triple {5039#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5039#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:43,668 INFO L273 TraceCheckUtils]: 33: Hoare triple {5039#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5040#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:43,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {5040#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5040#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:43,670 INFO L273 TraceCheckUtils]: 35: Hoare triple {5040#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5041#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:43,670 INFO L273 TraceCheckUtils]: 36: Hoare triple {5041#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5041#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:43,671 INFO L273 TraceCheckUtils]: 37: Hoare triple {5041#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5042#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:43,672 INFO L273 TraceCheckUtils]: 38: Hoare triple {5042#(<= main_~j~0 16)} assume !(~j~0 < 20); {5025#false} is VALID [2018-11-23 12:54:43,672 INFO L273 TraceCheckUtils]: 39: Hoare triple {5025#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5025#false} is VALID [2018-11-23 12:54:43,672 INFO L273 TraceCheckUtils]: 40: Hoare triple {5025#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5025#false} is VALID [2018-11-23 12:54:43,672 INFO L273 TraceCheckUtils]: 41: Hoare triple {5025#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5025#false} is VALID [2018-11-23 12:54:43,673 INFO L273 TraceCheckUtils]: 42: Hoare triple {5025#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5025#false} is VALID [2018-11-23 12:54:43,673 INFO L256 TraceCheckUtils]: 43: Hoare triple {5025#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5025#false} is VALID [2018-11-23 12:54:43,673 INFO L273 TraceCheckUtils]: 44: Hoare triple {5025#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5025#false} is VALID [2018-11-23 12:54:43,673 INFO L273 TraceCheckUtils]: 45: Hoare triple {5025#false} assume true; {5025#false} is VALID [2018-11-23 12:54:43,673 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5025#false} {5025#false} #57#return; {5025#false} is VALID [2018-11-23 12:54:43,674 INFO L273 TraceCheckUtils]: 47: Hoare triple {5025#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5025#false} is VALID [2018-11-23 12:54:43,674 INFO L273 TraceCheckUtils]: 48: Hoare triple {5025#false} assume 0 == #t~ret8;havoc #t~ret8; {5025#false} is VALID [2018-11-23 12:54:43,674 INFO L273 TraceCheckUtils]: 49: Hoare triple {5025#false} assume !false; {5025#false} is VALID [2018-11-23 12:54:43,677 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:43,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:43,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:54:43,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-11-23 12:54:43,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:43,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:54:43,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:43,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:54:43,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:54:43,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:54:43,759 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 20 states. [2018-11-23 12:54:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,334 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:54:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:54:44,334 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-11-23 12:54:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2018-11-23 12:54:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:54:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2018-11-23 12:54:44,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 68 transitions. [2018-11-23 12:54:44,422 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:44,424 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:54:44,425 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:54:44,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:54:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:54:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 12:54:44,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:44,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2018-11-23 12:54:44,570 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2018-11-23 12:54:44,571 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2018-11-23 12:54:44,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,573 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 12:54:44,573 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:54:44,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:44,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:44,574 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2018-11-23 12:54:44,574 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2018-11-23 12:54:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:44,575 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 12:54:44,576 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:54:44,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:44,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:44,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:44,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:44,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:54:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 12:54:44,578 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-11-23 12:54:44,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:44,578 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 12:54:44,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:54:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:54:44,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:54:44,579 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:44,580 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:44,580 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:44,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:44,580 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2018-11-23 12:54:44,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:44,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:44,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:44,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:44,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:45,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {5476#true} call ULTIMATE.init(); {5476#true} is VALID [2018-11-23 12:54:45,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {5476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5476#true} is VALID [2018-11-23 12:54:45,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {5476#true} assume true; {5476#true} is VALID [2018-11-23 12:54:45,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5476#true} {5476#true} #53#return; {5476#true} is VALID [2018-11-23 12:54:45,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {5476#true} call #t~ret9 := main(); {5476#true} is VALID [2018-11-23 12:54:45,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {5476#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5478#(= main_~j~0 0)} is VALID [2018-11-23 12:54:45,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {5478#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5478#(= main_~j~0 0)} is VALID [2018-11-23 12:54:45,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {5478#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5479#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:45,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {5479#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5479#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:45,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {5479#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5480#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:45,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {5480#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5480#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:45,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {5480#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5481#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:45,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {5481#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5481#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:45,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5482#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:45,435 INFO L273 TraceCheckUtils]: 14: Hoare triple {5482#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5482#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:45,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {5482#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5483#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:45,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {5483#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5483#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:45,438 INFO L273 TraceCheckUtils]: 17: Hoare triple {5483#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5484#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:45,438 INFO L273 TraceCheckUtils]: 18: Hoare triple {5484#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5484#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:45,439 INFO L273 TraceCheckUtils]: 19: Hoare triple {5484#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5485#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:45,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {5485#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5485#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:45,441 INFO L273 TraceCheckUtils]: 21: Hoare triple {5485#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5486#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:45,441 INFO L273 TraceCheckUtils]: 22: Hoare triple {5486#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5486#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:45,442 INFO L273 TraceCheckUtils]: 23: Hoare triple {5486#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5487#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:45,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {5487#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5487#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:45,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {5487#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5488#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:45,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {5488#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5488#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:45,445 INFO L273 TraceCheckUtils]: 27: Hoare triple {5488#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5489#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:45,446 INFO L273 TraceCheckUtils]: 28: Hoare triple {5489#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5489#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:45,447 INFO L273 TraceCheckUtils]: 29: Hoare triple {5489#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5490#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:45,447 INFO L273 TraceCheckUtils]: 30: Hoare triple {5490#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5490#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:45,448 INFO L273 TraceCheckUtils]: 31: Hoare triple {5490#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5491#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:45,449 INFO L273 TraceCheckUtils]: 32: Hoare triple {5491#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5491#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:45,450 INFO L273 TraceCheckUtils]: 33: Hoare triple {5491#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5492#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:45,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {5492#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5492#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:45,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {5492#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5493#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:45,452 INFO L273 TraceCheckUtils]: 36: Hoare triple {5493#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5493#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:45,453 INFO L273 TraceCheckUtils]: 37: Hoare triple {5493#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5494#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:45,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {5494#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5494#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:45,470 INFO L273 TraceCheckUtils]: 39: Hoare triple {5494#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5495#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:45,478 INFO L273 TraceCheckUtils]: 40: Hoare triple {5495#(<= main_~j~0 17)} assume !(~j~0 < 20); {5477#false} is VALID [2018-11-23 12:54:45,478 INFO L273 TraceCheckUtils]: 41: Hoare triple {5477#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5477#false} is VALID [2018-11-23 12:54:45,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {5477#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5477#false} is VALID [2018-11-23 12:54:45,478 INFO L273 TraceCheckUtils]: 43: Hoare triple {5477#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5477#false} is VALID [2018-11-23 12:54:45,478 INFO L273 TraceCheckUtils]: 44: Hoare triple {5477#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5477#false} is VALID [2018-11-23 12:54:45,479 INFO L256 TraceCheckUtils]: 45: Hoare triple {5477#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5476#true} is VALID [2018-11-23 12:54:45,479 INFO L273 TraceCheckUtils]: 46: Hoare triple {5476#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5476#true} is VALID [2018-11-23 12:54:45,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {5476#true} assume true; {5476#true} is VALID [2018-11-23 12:54:45,479 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5476#true} {5477#false} #57#return; {5477#false} is VALID [2018-11-23 12:54:45,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {5477#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5477#false} is VALID [2018-11-23 12:54:45,479 INFO L273 TraceCheckUtils]: 50: Hoare triple {5477#false} assume 0 == #t~ret8;havoc #t~ret8; {5477#false} is VALID [2018-11-23 12:54:45,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {5477#false} assume !false; {5477#false} is VALID [2018-11-23 12:54:45,483 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:45,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:45,483 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:45,510 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:54:47,361 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 12:54:47,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:47,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:47,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {5476#true} call ULTIMATE.init(); {5476#true} is VALID [2018-11-23 12:54:47,651 INFO L273 TraceCheckUtils]: 1: Hoare triple {5476#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5476#true} is VALID [2018-11-23 12:54:47,651 INFO L273 TraceCheckUtils]: 2: Hoare triple {5476#true} assume true; {5476#true} is VALID [2018-11-23 12:54:47,652 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5476#true} {5476#true} #53#return; {5476#true} is VALID [2018-11-23 12:54:47,652 INFO L256 TraceCheckUtils]: 4: Hoare triple {5476#true} call #t~ret9 := main(); {5476#true} is VALID [2018-11-23 12:54:47,653 INFO L273 TraceCheckUtils]: 5: Hoare triple {5476#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5514#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:47,653 INFO L273 TraceCheckUtils]: 6: Hoare triple {5514#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5514#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:47,654 INFO L273 TraceCheckUtils]: 7: Hoare triple {5514#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5479#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:47,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {5479#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5479#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:47,655 INFO L273 TraceCheckUtils]: 9: Hoare triple {5479#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5480#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:47,655 INFO L273 TraceCheckUtils]: 10: Hoare triple {5480#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5480#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:47,655 INFO L273 TraceCheckUtils]: 11: Hoare triple {5480#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5481#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:47,656 INFO L273 TraceCheckUtils]: 12: Hoare triple {5481#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5481#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:47,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {5481#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5482#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:47,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {5482#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5482#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:47,658 INFO L273 TraceCheckUtils]: 15: Hoare triple {5482#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5483#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:47,658 INFO L273 TraceCheckUtils]: 16: Hoare triple {5483#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5483#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:47,659 INFO L273 TraceCheckUtils]: 17: Hoare triple {5483#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5484#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:47,660 INFO L273 TraceCheckUtils]: 18: Hoare triple {5484#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5484#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:47,661 INFO L273 TraceCheckUtils]: 19: Hoare triple {5484#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5485#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:47,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {5485#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5485#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:47,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {5485#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5486#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:47,662 INFO L273 TraceCheckUtils]: 22: Hoare triple {5486#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5486#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:47,663 INFO L273 TraceCheckUtils]: 23: Hoare triple {5486#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5487#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:47,664 INFO L273 TraceCheckUtils]: 24: Hoare triple {5487#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5487#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:47,664 INFO L273 TraceCheckUtils]: 25: Hoare triple {5487#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5488#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:47,665 INFO L273 TraceCheckUtils]: 26: Hoare triple {5488#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5488#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:47,666 INFO L273 TraceCheckUtils]: 27: Hoare triple {5488#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5489#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:47,666 INFO L273 TraceCheckUtils]: 28: Hoare triple {5489#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5489#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:47,667 INFO L273 TraceCheckUtils]: 29: Hoare triple {5489#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5490#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:47,668 INFO L273 TraceCheckUtils]: 30: Hoare triple {5490#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5490#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:47,668 INFO L273 TraceCheckUtils]: 31: Hoare triple {5490#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5491#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:47,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {5491#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5491#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:47,670 INFO L273 TraceCheckUtils]: 33: Hoare triple {5491#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5492#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:47,670 INFO L273 TraceCheckUtils]: 34: Hoare triple {5492#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5492#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:47,671 INFO L273 TraceCheckUtils]: 35: Hoare triple {5492#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5493#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:47,671 INFO L273 TraceCheckUtils]: 36: Hoare triple {5493#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5493#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:47,672 INFO L273 TraceCheckUtils]: 37: Hoare triple {5493#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5494#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:47,673 INFO L273 TraceCheckUtils]: 38: Hoare triple {5494#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5494#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:47,673 INFO L273 TraceCheckUtils]: 39: Hoare triple {5494#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5495#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:47,674 INFO L273 TraceCheckUtils]: 40: Hoare triple {5495#(<= main_~j~0 17)} assume !(~j~0 < 20); {5477#false} is VALID [2018-11-23 12:54:47,674 INFO L273 TraceCheckUtils]: 41: Hoare triple {5477#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5477#false} is VALID [2018-11-23 12:54:47,674 INFO L273 TraceCheckUtils]: 42: Hoare triple {5477#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5477#false} is VALID [2018-11-23 12:54:47,675 INFO L273 TraceCheckUtils]: 43: Hoare triple {5477#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5477#false} is VALID [2018-11-23 12:54:47,675 INFO L273 TraceCheckUtils]: 44: Hoare triple {5477#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5477#false} is VALID [2018-11-23 12:54:47,675 INFO L256 TraceCheckUtils]: 45: Hoare triple {5477#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5477#false} is VALID [2018-11-23 12:54:47,675 INFO L273 TraceCheckUtils]: 46: Hoare triple {5477#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5477#false} is VALID [2018-11-23 12:54:47,675 INFO L273 TraceCheckUtils]: 47: Hoare triple {5477#false} assume true; {5477#false} is VALID [2018-11-23 12:54:47,676 INFO L268 TraceCheckUtils]: 48: Hoare quadruple {5477#false} {5477#false} #57#return; {5477#false} is VALID [2018-11-23 12:54:47,676 INFO L273 TraceCheckUtils]: 49: Hoare triple {5477#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5477#false} is VALID [2018-11-23 12:54:47,676 INFO L273 TraceCheckUtils]: 50: Hoare triple {5477#false} assume 0 == #t~ret8;havoc #t~ret8; {5477#false} is VALID [2018-11-23 12:54:47,676 INFO L273 TraceCheckUtils]: 51: Hoare triple {5477#false} assume !false; {5477#false} is VALID [2018-11-23 12:54:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:47,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:47,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:54:47,700 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-11-23 12:54:47,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:47,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:54:47,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:47,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:54:47,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:54:47,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:54:47,761 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 21 states. [2018-11-23 12:54:48,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,824 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 12:54:48,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:54:48,824 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-11-23 12:54:48,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2018-11-23 12:54:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:54:48,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2018-11-23 12:54:48,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2018-11-23 12:54:48,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:48,941 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:54:48,941 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:54:48,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:54:48,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:54:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 12:54:48,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:48,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-23 12:54:48,977 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-23 12:54:48,977 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-23 12:54:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,979 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 12:54:48,980 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:54:48,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:48,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:48,980 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-23 12:54:48,980 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-23 12:54:48,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:48,982 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 12:54:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:54:48,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:48,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:48,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:48,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:54:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-23 12:54:48,984 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-11-23 12:54:48,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:48,984 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-23 12:54:48,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:54:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:54:48,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:54:48,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:48,985 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:48,986 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:48,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2018-11-23 12:54:48,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:48,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:48,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:48,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:50,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {5945#true} call ULTIMATE.init(); {5945#true} is VALID [2018-11-23 12:54:50,034 INFO L273 TraceCheckUtils]: 1: Hoare triple {5945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5945#true} is VALID [2018-11-23 12:54:50,034 INFO L273 TraceCheckUtils]: 2: Hoare triple {5945#true} assume true; {5945#true} is VALID [2018-11-23 12:54:50,035 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5945#true} {5945#true} #53#return; {5945#true} is VALID [2018-11-23 12:54:50,035 INFO L256 TraceCheckUtils]: 4: Hoare triple {5945#true} call #t~ret9 := main(); {5945#true} is VALID [2018-11-23 12:54:50,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {5945#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5947#(= main_~j~0 0)} is VALID [2018-11-23 12:54:50,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {5947#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5947#(= main_~j~0 0)} is VALID [2018-11-23 12:54:50,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {5947#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5948#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:50,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {5948#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5948#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:50,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {5948#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5949#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:50,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {5949#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5949#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:50,044 INFO L273 TraceCheckUtils]: 11: Hoare triple {5949#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5950#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:50,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {5950#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5950#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:50,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {5950#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5951#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:50,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {5951#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5951#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:50,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {5951#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5952#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:50,046 INFO L273 TraceCheckUtils]: 16: Hoare triple {5952#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5952#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:50,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {5952#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5953#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:50,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {5953#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5953#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:50,048 INFO L273 TraceCheckUtils]: 19: Hoare triple {5953#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5954#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:50,049 INFO L273 TraceCheckUtils]: 20: Hoare triple {5954#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5954#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:50,050 INFO L273 TraceCheckUtils]: 21: Hoare triple {5954#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5955#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:50,051 INFO L273 TraceCheckUtils]: 22: Hoare triple {5955#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5955#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:50,052 INFO L273 TraceCheckUtils]: 23: Hoare triple {5955#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5956#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:50,052 INFO L273 TraceCheckUtils]: 24: Hoare triple {5956#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5956#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:50,053 INFO L273 TraceCheckUtils]: 25: Hoare triple {5956#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5957#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:50,053 INFO L273 TraceCheckUtils]: 26: Hoare triple {5957#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5957#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:50,053 INFO L273 TraceCheckUtils]: 27: Hoare triple {5957#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5958#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:50,054 INFO L273 TraceCheckUtils]: 28: Hoare triple {5958#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5958#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:50,054 INFO L273 TraceCheckUtils]: 29: Hoare triple {5958#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5959#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:50,055 INFO L273 TraceCheckUtils]: 30: Hoare triple {5959#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5959#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:50,055 INFO L273 TraceCheckUtils]: 31: Hoare triple {5959#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5960#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:50,056 INFO L273 TraceCheckUtils]: 32: Hoare triple {5960#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5960#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:50,057 INFO L273 TraceCheckUtils]: 33: Hoare triple {5960#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5961#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:50,057 INFO L273 TraceCheckUtils]: 34: Hoare triple {5961#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5961#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:50,058 INFO L273 TraceCheckUtils]: 35: Hoare triple {5961#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5962#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:50,058 INFO L273 TraceCheckUtils]: 36: Hoare triple {5962#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5962#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:50,059 INFO L273 TraceCheckUtils]: 37: Hoare triple {5962#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5963#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:50,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {5963#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5963#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:50,061 INFO L273 TraceCheckUtils]: 39: Hoare triple {5963#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5964#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:50,061 INFO L273 TraceCheckUtils]: 40: Hoare triple {5964#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5964#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:50,062 INFO L273 TraceCheckUtils]: 41: Hoare triple {5964#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5965#(<= main_~j~0 18)} is VALID [2018-11-23 12:54:50,063 INFO L273 TraceCheckUtils]: 42: Hoare triple {5965#(<= main_~j~0 18)} assume !(~j~0 < 20); {5946#false} is VALID [2018-11-23 12:54:50,063 INFO L273 TraceCheckUtils]: 43: Hoare triple {5946#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5946#false} is VALID [2018-11-23 12:54:50,063 INFO L273 TraceCheckUtils]: 44: Hoare triple {5946#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5946#false} is VALID [2018-11-23 12:54:50,063 INFO L273 TraceCheckUtils]: 45: Hoare triple {5946#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5946#false} is VALID [2018-11-23 12:54:50,063 INFO L273 TraceCheckUtils]: 46: Hoare triple {5946#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5946#false} is VALID [2018-11-23 12:54:50,064 INFO L256 TraceCheckUtils]: 47: Hoare triple {5946#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5945#true} is VALID [2018-11-23 12:54:50,064 INFO L273 TraceCheckUtils]: 48: Hoare triple {5945#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5945#true} is VALID [2018-11-23 12:54:50,064 INFO L273 TraceCheckUtils]: 49: Hoare triple {5945#true} assume true; {5945#true} is VALID [2018-11-23 12:54:50,064 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5945#true} {5946#false} #57#return; {5946#false} is VALID [2018-11-23 12:54:50,064 INFO L273 TraceCheckUtils]: 51: Hoare triple {5946#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5946#false} is VALID [2018-11-23 12:54:50,065 INFO L273 TraceCheckUtils]: 52: Hoare triple {5946#false} assume 0 == #t~ret8;havoc #t~ret8; {5946#false} is VALID [2018-11-23 12:54:50,065 INFO L273 TraceCheckUtils]: 53: Hoare triple {5946#false} assume !false; {5946#false} is VALID [2018-11-23 12:54:50,068 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:50,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:50,068 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:50,076 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:54:57,025 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:54:57,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:54:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:57,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:57,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {5945#true} call ULTIMATE.init(); {5945#true} is VALID [2018-11-23 12:54:57,246 INFO L273 TraceCheckUtils]: 1: Hoare triple {5945#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5945#true} is VALID [2018-11-23 12:54:57,246 INFO L273 TraceCheckUtils]: 2: Hoare triple {5945#true} assume true; {5945#true} is VALID [2018-11-23 12:54:57,246 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5945#true} {5945#true} #53#return; {5945#true} is VALID [2018-11-23 12:54:57,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {5945#true} call #t~ret9 := main(); {5945#true} is VALID [2018-11-23 12:54:57,247 INFO L273 TraceCheckUtils]: 5: Hoare triple {5945#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {5984#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:57,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {5984#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5984#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:57,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {5984#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5948#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:57,249 INFO L273 TraceCheckUtils]: 8: Hoare triple {5948#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5948#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:57,249 INFO L273 TraceCheckUtils]: 9: Hoare triple {5948#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5949#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:57,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {5949#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5949#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:57,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {5949#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5950#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:57,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {5950#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5950#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:57,251 INFO L273 TraceCheckUtils]: 13: Hoare triple {5950#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5951#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:57,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {5951#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5951#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:57,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {5951#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5952#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:57,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {5952#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5952#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:57,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {5952#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5953#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:57,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {5953#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5953#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:57,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {5953#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5954#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:57,255 INFO L273 TraceCheckUtils]: 20: Hoare triple {5954#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5954#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:57,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {5954#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5955#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:57,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {5955#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5955#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:57,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {5955#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5956#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:57,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {5956#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5956#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:57,259 INFO L273 TraceCheckUtils]: 25: Hoare triple {5956#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5957#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:57,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {5957#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5957#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:57,260 INFO L273 TraceCheckUtils]: 27: Hoare triple {5957#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5958#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:57,261 INFO L273 TraceCheckUtils]: 28: Hoare triple {5958#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5958#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:57,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {5958#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5959#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:57,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {5959#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5959#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:57,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {5959#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5960#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:57,282 INFO L273 TraceCheckUtils]: 32: Hoare triple {5960#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5960#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:57,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {5960#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5961#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:57,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {5961#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5961#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:57,283 INFO L273 TraceCheckUtils]: 35: Hoare triple {5961#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5962#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:57,283 INFO L273 TraceCheckUtils]: 36: Hoare triple {5962#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5962#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:57,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {5962#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5963#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:57,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {5963#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5963#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:57,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {5963#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5964#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:57,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {5964#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {5964#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:57,286 INFO L273 TraceCheckUtils]: 41: Hoare triple {5964#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {5965#(<= main_~j~0 18)} is VALID [2018-11-23 12:54:57,286 INFO L273 TraceCheckUtils]: 42: Hoare triple {5965#(<= main_~j~0 18)} assume !(~j~0 < 20); {5946#false} is VALID [2018-11-23 12:54:57,287 INFO L273 TraceCheckUtils]: 43: Hoare triple {5946#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {5946#false} is VALID [2018-11-23 12:54:57,287 INFO L273 TraceCheckUtils]: 44: Hoare triple {5946#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {5946#false} is VALID [2018-11-23 12:54:57,287 INFO L273 TraceCheckUtils]: 45: Hoare triple {5946#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {5946#false} is VALID [2018-11-23 12:54:57,287 INFO L273 TraceCheckUtils]: 46: Hoare triple {5946#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {5946#false} is VALID [2018-11-23 12:54:57,287 INFO L256 TraceCheckUtils]: 47: Hoare triple {5946#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {5946#false} is VALID [2018-11-23 12:54:57,288 INFO L273 TraceCheckUtils]: 48: Hoare triple {5946#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {5946#false} is VALID [2018-11-23 12:54:57,288 INFO L273 TraceCheckUtils]: 49: Hoare triple {5946#false} assume true; {5946#false} is VALID [2018-11-23 12:54:57,288 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {5946#false} {5946#false} #57#return; {5946#false} is VALID [2018-11-23 12:54:57,288 INFO L273 TraceCheckUtils]: 51: Hoare triple {5946#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {5946#false} is VALID [2018-11-23 12:54:57,288 INFO L273 TraceCheckUtils]: 52: Hoare triple {5946#false} assume 0 == #t~ret8;havoc #t~ret8; {5946#false} is VALID [2018-11-23 12:54:57,289 INFO L273 TraceCheckUtils]: 53: Hoare triple {5946#false} assume !false; {5946#false} is VALID [2018-11-23 12:54:57,291 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:57,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:57,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:54:57,315 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-11-23 12:54:57,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:57,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:54:57,379 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:57,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:54:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:54:57,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:54:57,380 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 22 states. [2018-11-23 12:54:57,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:57,718 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 12:54:57,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:54:57,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-11-23 12:54:57,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:57,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:54:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-23 12:54:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:54:57,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-23 12:54:57,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 72 transitions. [2018-11-23 12:54:58,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:58,130 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:54:58,131 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:54:58,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:54:58,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:54:58,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 12:54:58,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:58,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2018-11-23 12:54:58,154 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2018-11-23 12:54:58,154 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2018-11-23 12:54:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:58,155 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:54:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:54:58,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:58,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:58,156 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2018-11-23 12:54:58,156 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2018-11-23 12:54:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:58,157 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:54:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:54:58,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:58,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:58,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:58,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:54:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 12:54:58,159 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-11-23 12:54:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:58,160 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 12:54:58,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:54:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:54:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:54:58,161 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:58,161 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:58,161 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:58,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2018-11-23 12:54:58,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:58,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:58,162 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:54:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:58,529 INFO L256 TraceCheckUtils]: 0: Hoare triple {6431#true} call ULTIMATE.init(); {6431#true} is VALID [2018-11-23 12:54:58,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {6431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6431#true} is VALID [2018-11-23 12:54:58,529 INFO L273 TraceCheckUtils]: 2: Hoare triple {6431#true} assume true; {6431#true} is VALID [2018-11-23 12:54:58,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6431#true} {6431#true} #53#return; {6431#true} is VALID [2018-11-23 12:54:58,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {6431#true} call #t~ret9 := main(); {6431#true} is VALID [2018-11-23 12:54:58,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {6431#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6433#(= main_~j~0 0)} is VALID [2018-11-23 12:54:58,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {6433#(= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6433#(= main_~j~0 0)} is VALID [2018-11-23 12:54:58,531 INFO L273 TraceCheckUtils]: 7: Hoare triple {6433#(= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6434#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:58,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {6434#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6434#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:58,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {6434#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6435#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:58,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {6435#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6435#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:58,534 INFO L273 TraceCheckUtils]: 11: Hoare triple {6435#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6436#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:58,535 INFO L273 TraceCheckUtils]: 12: Hoare triple {6436#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6436#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:58,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {6436#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6437#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:58,536 INFO L273 TraceCheckUtils]: 14: Hoare triple {6437#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6437#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:58,537 INFO L273 TraceCheckUtils]: 15: Hoare triple {6437#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6438#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:58,537 INFO L273 TraceCheckUtils]: 16: Hoare triple {6438#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6438#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:58,538 INFO L273 TraceCheckUtils]: 17: Hoare triple {6438#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6439#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:58,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {6439#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6439#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:58,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {6439#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6440#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:58,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {6440#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6440#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:58,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {6440#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6441#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:58,541 INFO L273 TraceCheckUtils]: 22: Hoare triple {6441#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6441#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:58,542 INFO L273 TraceCheckUtils]: 23: Hoare triple {6441#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6442#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:58,542 INFO L273 TraceCheckUtils]: 24: Hoare triple {6442#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6442#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:58,543 INFO L273 TraceCheckUtils]: 25: Hoare triple {6442#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6443#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:58,544 INFO L273 TraceCheckUtils]: 26: Hoare triple {6443#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6443#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:58,544 INFO L273 TraceCheckUtils]: 27: Hoare triple {6443#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6444#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:58,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {6444#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6444#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:58,546 INFO L273 TraceCheckUtils]: 29: Hoare triple {6444#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6445#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:58,546 INFO L273 TraceCheckUtils]: 30: Hoare triple {6445#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6445#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:58,547 INFO L273 TraceCheckUtils]: 31: Hoare triple {6445#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6446#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:58,547 INFO L273 TraceCheckUtils]: 32: Hoare triple {6446#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6446#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:58,548 INFO L273 TraceCheckUtils]: 33: Hoare triple {6446#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6447#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:58,549 INFO L273 TraceCheckUtils]: 34: Hoare triple {6447#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6447#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:58,549 INFO L273 TraceCheckUtils]: 35: Hoare triple {6447#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6448#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:58,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {6448#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6448#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:58,551 INFO L273 TraceCheckUtils]: 37: Hoare triple {6448#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6449#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:58,551 INFO L273 TraceCheckUtils]: 38: Hoare triple {6449#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6449#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:58,552 INFO L273 TraceCheckUtils]: 39: Hoare triple {6449#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6450#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:58,553 INFO L273 TraceCheckUtils]: 40: Hoare triple {6450#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6450#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:58,554 INFO L273 TraceCheckUtils]: 41: Hoare triple {6450#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6451#(<= main_~j~0 18)} is VALID [2018-11-23 12:54:58,554 INFO L273 TraceCheckUtils]: 42: Hoare triple {6451#(<= main_~j~0 18)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6451#(<= main_~j~0 18)} is VALID [2018-11-23 12:54:58,555 INFO L273 TraceCheckUtils]: 43: Hoare triple {6451#(<= main_~j~0 18)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6452#(<= main_~j~0 19)} is VALID [2018-11-23 12:54:58,556 INFO L273 TraceCheckUtils]: 44: Hoare triple {6452#(<= main_~j~0 19)} assume !(~j~0 < 20); {6432#false} is VALID [2018-11-23 12:54:58,556 INFO L273 TraceCheckUtils]: 45: Hoare triple {6432#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6432#false} is VALID [2018-11-23 12:54:58,556 INFO L273 TraceCheckUtils]: 46: Hoare triple {6432#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6432#false} is VALID [2018-11-23 12:54:58,556 INFO L273 TraceCheckUtils]: 47: Hoare triple {6432#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6432#false} is VALID [2018-11-23 12:54:58,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {6432#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6432#false} is VALID [2018-11-23 12:54:58,557 INFO L256 TraceCheckUtils]: 49: Hoare triple {6432#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6431#true} is VALID [2018-11-23 12:54:58,557 INFO L273 TraceCheckUtils]: 50: Hoare triple {6431#true} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6431#true} is VALID [2018-11-23 12:54:58,557 INFO L273 TraceCheckUtils]: 51: Hoare triple {6431#true} assume true; {6431#true} is VALID [2018-11-23 12:54:58,557 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {6431#true} {6432#false} #57#return; {6432#false} is VALID [2018-11-23 12:54:58,558 INFO L273 TraceCheckUtils]: 53: Hoare triple {6432#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6432#false} is VALID [2018-11-23 12:54:58,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {6432#false} assume 0 == #t~ret8;havoc #t~ret8; {6432#false} is VALID [2018-11-23 12:54:58,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {6432#false} assume !false; {6432#false} is VALID [2018-11-23 12:54:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:58,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:54:58,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:54:58,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:58,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:54:58,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:54:58,810 INFO L256 TraceCheckUtils]: 0: Hoare triple {6431#true} call ULTIMATE.init(); {6431#true} is VALID [2018-11-23 12:54:58,810 INFO L273 TraceCheckUtils]: 1: Hoare triple {6431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6431#true} is VALID [2018-11-23 12:54:58,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {6431#true} assume true; {6431#true} is VALID [2018-11-23 12:54:58,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6431#true} {6431#true} #53#return; {6431#true} is VALID [2018-11-23 12:54:58,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {6431#true} call #t~ret9 := main(); {6431#true} is VALID [2018-11-23 12:54:58,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {6431#true} call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; {6471#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:58,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {6471#(<= main_~j~0 0)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6471#(<= main_~j~0 0)} is VALID [2018-11-23 12:54:58,813 INFO L273 TraceCheckUtils]: 7: Hoare triple {6471#(<= main_~j~0 0)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6434#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:58,813 INFO L273 TraceCheckUtils]: 8: Hoare triple {6434#(<= main_~j~0 1)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6434#(<= main_~j~0 1)} is VALID [2018-11-23 12:54:58,814 INFO L273 TraceCheckUtils]: 9: Hoare triple {6434#(<= main_~j~0 1)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6435#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:58,814 INFO L273 TraceCheckUtils]: 10: Hoare triple {6435#(<= main_~j~0 2)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6435#(<= main_~j~0 2)} is VALID [2018-11-23 12:54:58,814 INFO L273 TraceCheckUtils]: 11: Hoare triple {6435#(<= main_~j~0 2)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6436#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:58,815 INFO L273 TraceCheckUtils]: 12: Hoare triple {6436#(<= main_~j~0 3)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6436#(<= main_~j~0 3)} is VALID [2018-11-23 12:54:58,815 INFO L273 TraceCheckUtils]: 13: Hoare triple {6436#(<= main_~j~0 3)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6437#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:58,815 INFO L273 TraceCheckUtils]: 14: Hoare triple {6437#(<= main_~j~0 4)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6437#(<= main_~j~0 4)} is VALID [2018-11-23 12:54:58,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {6437#(<= main_~j~0 4)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6438#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:58,817 INFO L273 TraceCheckUtils]: 16: Hoare triple {6438#(<= main_~j~0 5)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6438#(<= main_~j~0 5)} is VALID [2018-11-23 12:54:58,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {6438#(<= main_~j~0 5)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6439#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:58,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {6439#(<= main_~j~0 6)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6439#(<= main_~j~0 6)} is VALID [2018-11-23 12:54:58,819 INFO L273 TraceCheckUtils]: 19: Hoare triple {6439#(<= main_~j~0 6)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6440#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:58,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {6440#(<= main_~j~0 7)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6440#(<= main_~j~0 7)} is VALID [2018-11-23 12:54:58,820 INFO L273 TraceCheckUtils]: 21: Hoare triple {6440#(<= main_~j~0 7)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6441#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:58,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {6441#(<= main_~j~0 8)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6441#(<= main_~j~0 8)} is VALID [2018-11-23 12:54:58,821 INFO L273 TraceCheckUtils]: 23: Hoare triple {6441#(<= main_~j~0 8)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6442#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:58,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {6442#(<= main_~j~0 9)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6442#(<= main_~j~0 9)} is VALID [2018-11-23 12:54:58,822 INFO L273 TraceCheckUtils]: 25: Hoare triple {6442#(<= main_~j~0 9)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6443#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:58,823 INFO L273 TraceCheckUtils]: 26: Hoare triple {6443#(<= main_~j~0 10)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6443#(<= main_~j~0 10)} is VALID [2018-11-23 12:54:58,824 INFO L273 TraceCheckUtils]: 27: Hoare triple {6443#(<= main_~j~0 10)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6444#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:58,824 INFO L273 TraceCheckUtils]: 28: Hoare triple {6444#(<= main_~j~0 11)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6444#(<= main_~j~0 11)} is VALID [2018-11-23 12:54:58,825 INFO L273 TraceCheckUtils]: 29: Hoare triple {6444#(<= main_~j~0 11)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6445#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:58,825 INFO L273 TraceCheckUtils]: 30: Hoare triple {6445#(<= main_~j~0 12)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6445#(<= main_~j~0 12)} is VALID [2018-11-23 12:54:58,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {6445#(<= main_~j~0 12)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6446#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:58,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {6446#(<= main_~j~0 13)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6446#(<= main_~j~0 13)} is VALID [2018-11-23 12:54:58,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {6446#(<= main_~j~0 13)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6447#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:58,828 INFO L273 TraceCheckUtils]: 34: Hoare triple {6447#(<= main_~j~0 14)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6447#(<= main_~j~0 14)} is VALID [2018-11-23 12:54:58,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {6447#(<= main_~j~0 14)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6448#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:58,829 INFO L273 TraceCheckUtils]: 36: Hoare triple {6448#(<= main_~j~0 15)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6448#(<= main_~j~0 15)} is VALID [2018-11-23 12:54:58,830 INFO L273 TraceCheckUtils]: 37: Hoare triple {6448#(<= main_~j~0 15)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6449#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:58,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {6449#(<= main_~j~0 16)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6449#(<= main_~j~0 16)} is VALID [2018-11-23 12:54:58,831 INFO L273 TraceCheckUtils]: 39: Hoare triple {6449#(<= main_~j~0 16)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6450#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:58,832 INFO L273 TraceCheckUtils]: 40: Hoare triple {6450#(<= main_~j~0 17)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6450#(<= main_~j~0 17)} is VALID [2018-11-23 12:54:58,833 INFO L273 TraceCheckUtils]: 41: Hoare triple {6450#(<= main_~j~0 17)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6451#(<= main_~j~0 18)} is VALID [2018-11-23 12:54:58,833 INFO L273 TraceCheckUtils]: 42: Hoare triple {6451#(<= main_~j~0 18)} assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; {6451#(<= main_~j~0 18)} is VALID [2018-11-23 12:54:58,834 INFO L273 TraceCheckUtils]: 43: Hoare triple {6451#(<= main_~j~0 18)} #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; {6452#(<= main_~j~0 19)} is VALID [2018-11-23 12:54:58,834 INFO L273 TraceCheckUtils]: 44: Hoare triple {6452#(<= main_~j~0 19)} assume !(~j~0 < 20); {6432#false} is VALID [2018-11-23 12:54:58,835 INFO L273 TraceCheckUtils]: 45: Hoare triple {6432#false} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; {6432#false} is VALID [2018-11-23 12:54:58,835 INFO L273 TraceCheckUtils]: 46: Hoare triple {6432#false} assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; {6432#false} is VALID [2018-11-23 12:54:58,835 INFO L273 TraceCheckUtils]: 47: Hoare triple {6432#false} call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); {6432#false} is VALID [2018-11-23 12:54:58,835 INFO L273 TraceCheckUtils]: 48: Hoare triple {6432#false} assume !(~i~0 < #t~mem6);havoc #t~mem6; {6432#false} is VALID [2018-11-23 12:54:58,836 INFO L256 TraceCheckUtils]: 49: Hoare triple {6432#false} call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); {6432#false} is VALID [2018-11-23 12:54:58,836 INFO L273 TraceCheckUtils]: 50: Hoare triple {6432#false} ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; {6432#false} is VALID [2018-11-23 12:54:58,836 INFO L273 TraceCheckUtils]: 51: Hoare triple {6432#false} assume true; {6432#false} is VALID [2018-11-23 12:54:58,836 INFO L268 TraceCheckUtils]: 52: Hoare quadruple {6432#false} {6432#false} #57#return; {6432#false} is VALID [2018-11-23 12:54:58,836 INFO L273 TraceCheckUtils]: 53: Hoare triple {6432#false} assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; {6432#false} is VALID [2018-11-23 12:54:58,836 INFO L273 TraceCheckUtils]: 54: Hoare triple {6432#false} assume 0 == #t~ret8;havoc #t~ret8; {6432#false} is VALID [2018-11-23 12:54:58,837 INFO L273 TraceCheckUtils]: 55: Hoare triple {6432#false} assume !false; {6432#false} is VALID [2018-11-23 12:54:58,840 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:54:58,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:54:58,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:54:58,861 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-11-23 12:54:58,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:54:58,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:54:58,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:58,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:54:58,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:54:58,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:54:58,929 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 23 states. [2018-11-23 12:54:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:59,353 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 12:54:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:54:59,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-11-23 12:54:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:54:59,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:54:59,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2018-11-23 12:54:59,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:54:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 73 transitions. [2018-11-23 12:54:59,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 73 transitions. [2018-11-23 12:54:59,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:54:59,809 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:54:59,809 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:54:59,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:54:59,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:54:59,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 12:54:59,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:54:59,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:59,826 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:59,826 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:59,829 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:54:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:54:59,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:59,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:59,829 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:59,830 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:54:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:54:59,831 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:54:59,831 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:54:59,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:54:59,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:54:59,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:54:59,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:54:59,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:54:59,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 12:54:59,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-11-23 12:54:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:54:59,834 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 12:54:59,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:54:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:54:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:54:59,835 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:54:59,835 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:54:59,835 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:54:59,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:54:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2018-11-23 12:54:59,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:54:59,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:54:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:59,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:54:59,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:54:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:54:59,996 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=163, |#NULL.offset|=161, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] RET #53#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~j~0 < 20); VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~i~0=0, main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~i~0 < #t~mem6);havoc #t~mem6; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10] [?] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] assume true; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] RET #57#return; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !false; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] ----- [2018-11-23 12:55:00,122 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2018-11-23 12:55:00,122 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:00,122 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 12:55:00,122 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 12:55:00,122 WARN L170 areAnnotationChecker]: checkENTRY has no Hoare annotation [2018-11-23 12:55:00,122 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: checkFINAL has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 12:55:00,123 WARN L170 areAnnotationChecker]: L17-4 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: checkEXIT has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2018-11-23 12:55:00,124 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2018-11-23 12:55:00,125 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 12:55:00,125 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:55:00,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 12:55:00 BoogieIcfgContainer [2018-11-23 12:55:00,129 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 12:55:00,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:55:00,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:55:00,130 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:55:00,130 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:55:00,133 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|=163, |#NULL.offset|=161, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] RET #53#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~j~0 < 20); VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~i~0=0, main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~i~0 < #t~mem6);havoc #t~mem6; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10] [?] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] assume true; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] RET #57#return; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !false; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] ----- [2018-11-23 12:55:00,296 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/ldv-regression/test24_false-unreach-call.c-witness.graphml [2018-11-23 12:55:00,296 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:55:00,298 INFO L168 Benchmark]: Toolchain (without parser) took 42597.00 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 1.9 GB in the end (delta: -475.4 MB). Peak memory consumption was 601.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:00,299 INFO L168 Benchmark]: CDTParser took 0.25 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:55:00,299 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.91 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:55:00,300 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.68 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:55:00,300 INFO L168 Benchmark]: Boogie Preprocessor took 36.59 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:55:00,300 INFO L168 Benchmark]: RCFGBuilder took 756.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:00,300 INFO L168 Benchmark]: TraceAbstraction took 41253.13 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 301.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 307.1 MB). Peak memory consumption was 608.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:00,301 INFO L168 Benchmark]: Witness Printer took 166.83 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:55:00,303 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.25 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 341.91 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 34.68 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 36.59 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 756.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 775.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -809.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41253.13 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 301.5 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 307.1 MB). Peak memory consumption was 608.6 MB. Max. memory is 7.1 GB. * Witness Printer took 166.83 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 41.1s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 11.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 210 SDslu, 3247 SDs, 0 SdLazy, 672 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 955 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=21, 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: 1.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 13.0s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 125333 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...