./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45294379b83c6b60e0b0199955cdf7244f057430 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:20:48,653 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:20:48,654 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:20:48,660 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:20:48,660 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:20:48,661 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:20:48,662 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:20:48,663 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:20:48,664 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:20:48,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:20:48,665 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:20:48,665 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:20:48,666 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:20:48,667 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:20:48,667 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:20:48,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:20:48,668 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:20:48,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:20:48,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:20:48,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:20:48,671 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:20:48,672 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:20:48,673 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:20:48,673 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:20:48,673 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:20:48,674 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:20:48,674 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:20:48,675 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:20:48,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:20:48,676 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:20:48,676 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:20:48,677 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:20:48,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:20:48,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:20:48,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:20:48,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:20:48,678 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-22 23:20:48,685 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:20:48,686 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:20:48,686 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-22 23:20:48,686 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-22 23:20:48,687 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-22 23:20:48,687 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-22 23:20:48,687 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-22 23:20:48,687 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-22 23:20:48,687 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-22 23:20:48,687 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-22 23:20:48,687 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-22 23:20:48,688 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-22 23:20:48,688 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-22 23:20:48,688 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:20:48,688 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 23:20:48,689 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:20:48,690 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:20:48,690 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-22 23:20:48,690 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:20:48,690 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:20:48,690 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-22 23:20:48,690 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-22 23:20:48,690 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-22 23:20:48,691 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-22 23:20:48,691 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45294379b83c6b60e0b0199955cdf7244f057430 [2018-11-22 23:20:48,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:20:48,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:20:48,728 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:20:48,729 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:20:48,730 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:20:48,730 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c [2018-11-22 23:20:48,774 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/data/0e2bab072/6bb09c788240440eb1687bff9f502a7f/FLAG622941861 [2018-11-22 23:20:49,093 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:20:49,093 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c [2018-11-22 23:20:49,097 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/data/0e2bab072/6bb09c788240440eb1687bff9f502a7f/FLAG622941861 [2018-11-22 23:20:49,106 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/data/0e2bab072/6bb09c788240440eb1687bff9f502a7f [2018-11-22 23:20:49,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:20:49,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:20:49,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:20:49,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:20:49,113 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:20:49,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76b02929 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49, skipping insertion in model container [2018-11-22 23:20:49,116 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:20:49,139 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:20:49,261 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:20:49,266 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:20:49,278 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:20:49,287 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:20:49,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49 WrapperNode [2018-11-22 23:20:49,288 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:20:49,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:20:49,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:20:49,288 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:20:49,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:20:49,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:20:49,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:20:49,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:20:49,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,311 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,350 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... [2018-11-22 23:20:49,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:20:49,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:20:49,357 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:20:49,357 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:20:49,358 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:20:49,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-22 23:20:49,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-22 23:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:20:49,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-22 23:20:49,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-22 23:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-22 23:20:49,392 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-22 23:20:49,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:20:49,520 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:20:49,520 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-22 23:20:49,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:20:49 BoogieIcfgContainer [2018-11-22 23:20:49,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:20:49,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-22 23:20:49,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-22 23:20:49,523 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-22 23:20:49,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:20:49" (1/3) ... [2018-11-22 23:20:49,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c23d38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:20:49, skipping insertion in model container [2018-11-22 23:20:49,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:20:49" (2/3) ... [2018-11-22 23:20:49,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c23d38e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:20:49, skipping insertion in model container [2018-11-22 23:20:49,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:20:49" (3/3) ... [2018-11-22 23:20:49,526 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_false-unreach-call.c [2018-11-22 23:20:49,534 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-22 23:20:49,540 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-22 23:20:49,549 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-22 23:20:49,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-22 23:20:49,572 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-22 23:20:49,572 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-22 23:20:49,572 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:20:49,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:20:49,572 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-22 23:20:49,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:20:49,572 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-22 23:20:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-22 23:20:49,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-22 23:20:49,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:49,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:20:49,589 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:49,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,592 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2018-11-22 23:20:49,594 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:49,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:49,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,681 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-22 23:20:49,682 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:20:49,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 23:20:49,682 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:20:49,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-22 23:20:49,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-22 23:20:49,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-22 23:20:49,694 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-22 23:20:49,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,706 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-22 23:20:49,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-22 23:20:49,707 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-22 23:20:49,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:49,713 INFO L225 Difference]: With dead ends: 42 [2018-11-22 23:20:49,713 INFO L226 Difference]: Without dead ends: 20 [2018-11-22 23:20:49,716 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-22 23:20:49,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-22 23:20:49,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-22 23:20:49,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-22 23:20:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-22 23:20:49,739 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-22 23:20:49,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:49,739 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-22 23:20:49,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-22 23:20:49,739 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-22 23:20:49,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-22 23:20:49,740 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:49,740 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-22 23:20:49,740 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:49,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2018-11-22 23:20:49,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:49,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,742 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,784 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-22 23:20:49,784 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:20:49,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-22 23:20:49,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-22 23:20:49,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-22 23:20:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 23:20:49,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 23:20:49,786 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-22 23:20:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:49,801 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-22 23:20:49,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 23:20:49,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-22 23:20:49,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:49,802 INFO L225 Difference]: With dead ends: 34 [2018-11-22 23:20:49,802 INFO L226 Difference]: Without dead ends: 22 [2018-11-22 23:20:49,803 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-22 23:20:49,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-22 23:20:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-22 23:20:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-22 23:20:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-22 23:20:49,806 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-22 23:20:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:49,806 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-22 23:20:49,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-22 23:20:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-22 23:20:49,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-22 23:20:49,807 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:49,807 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-22 23:20:49,807 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:49,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2018-11-22 23:20:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:49,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:49,851 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-22 23:20:49,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:49,852 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:49,853 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-11-22 23:20:49,854 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [11], [13], [15], [19], [22], [27], [30], [37], [40], [47], [50], [51], [52], [53], [54], [56], [57] [2018-11-22 23:20:49,873 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-22 23:20:49,874 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-22 23:20:50,003 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-22 23:20:50,004 INFO L272 AbstractInterpreter]: Visited 20 different actions 26 times. Merged at 2 different actions 4 times. Never widened. Performed 170 root evaluator evaluations with a maximum evaluation depth of 5. Performed 170 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 1 fixpoints after 1 different actions. Largest state had 25 variables. [2018-11-22 23:20:50,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-22 23:20:50,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,019 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:50,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:50,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:20:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:50,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:50,084 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-22 23:20:50,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:50,114 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-22 23:20:50,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:50,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-22 23:20:50,131 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:50,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-22 23:20:50,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 23:20:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:20:50,132 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-22 23:20:50,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:50,146 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-22 23:20:50,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 23:20:50,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-22 23:20:50,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:50,148 INFO L225 Difference]: With dead ends: 36 [2018-11-22 23:20:50,148 INFO L226 Difference]: Without dead ends: 24 [2018-11-22 23:20:50,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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-22 23:20:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-22 23:20:50,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-22 23:20:50,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-22 23:20:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-22 23:20:50,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-22 23:20:50,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:50,153 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-22 23:20:50,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-22 23:20:50,154 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-22 23:20:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-22 23:20:50,154 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:50,154 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-22 23:20:50,155 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:50,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2018-11-22 23:20:50,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:50,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:50,206 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-22 23:20:50,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:50,207 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:50,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:50,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:50,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:50,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:20:50,250 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 23:20:50,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:50,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:50,262 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-22 23:20:50,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:50,316 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-22 23:20:50,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:50,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-22 23:20:50,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:50,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-22 23:20:50,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:20:50,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-22 23:20:50,332 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-22 23:20:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:50,353 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-22 23:20:50,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 23:20:50,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-22 23:20:50,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:50,354 INFO L225 Difference]: With dead ends: 38 [2018-11-22 23:20:50,354 INFO L226 Difference]: Without dead ends: 26 [2018-11-22 23:20:50,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 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-22 23:20:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-22 23:20:50,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-22 23:20:50,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 23:20:50,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-22 23:20:50,357 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-22 23:20:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:50,357 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-22 23:20:50,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-22 23:20:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-22 23:20:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-22 23:20:50,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:50,358 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-22 23:20:50,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:50,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2018-11-22 23:20:50,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:50,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,359 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:50,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:50,414 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-22 23:20:50,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:50,415 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:50,415 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:50,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:50,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:50,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:20:50,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:50,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:50,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:50,447 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-22 23:20:50,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:50,509 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-22 23:20:50,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:50,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-22 23:20:50,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:50,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-22 23:20:50,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:20:50,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:20:50,525 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-11-22 23:20:50,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:50,540 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-22 23:20:50,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:20:50,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-22 23:20:50,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:50,541 INFO L225 Difference]: With dead ends: 40 [2018-11-22 23:20:50,541 INFO L226 Difference]: Without dead ends: 28 [2018-11-22 23:20:50,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-22 23:20:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-22 23:20:50,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-22 23:20:50,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-22 23:20:50,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-22 23:20:50,544 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-22 23:20:50,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:50,545 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-22 23:20:50,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-22 23:20:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-22 23:20:50,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-22 23:20:50,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:50,545 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-22 23:20:50,546 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:50,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2018-11-22 23:20:50,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:50,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,547 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:50,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,547 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:50,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:50,599 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-22 23:20:50,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:50,600 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:50,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:50,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,600 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:50,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:20:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:50,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:50,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-22 23:20:50,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:50,759 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-22 23:20:50,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:50,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-22 23:20:50,774 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:50,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-22 23:20:50,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-22 23:20:50,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:20:50,775 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-22 23:20:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:50,794 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-22 23:20:50,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:20:50,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-22 23:20:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:50,795 INFO L225 Difference]: With dead ends: 42 [2018-11-22 23:20:50,796 INFO L226 Difference]: Without dead ends: 30 [2018-11-22 23:20:50,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:20:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-22 23:20:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-22 23:20:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-22 23:20:50,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-22 23:20:50,800 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-22 23:20:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:50,800 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-22 23:20:50,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-22 23:20:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-22 23:20:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-22 23:20:50,801 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:50,801 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-22 23:20:50,801 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:50,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2018-11-22 23:20:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:50,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:50,864 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-22 23:20:50,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:50,864 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:50,864 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:50,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:50,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:50,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:50,870 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:20:50,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-22 23:20:50,904 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:50,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:50,915 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-22 23:20:50,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:50,998 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-22 23:20:51,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:51,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-22 23:20:51,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:51,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-22 23:20:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-22 23:20:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-22 23:20:51,014 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-22 23:20:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:51,044 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-22 23:20:51,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:20:51,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-22 23:20:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:51,047 INFO L225 Difference]: With dead ends: 44 [2018-11-22 23:20:51,047 INFO L226 Difference]: Without dead ends: 32 [2018-11-22 23:20:51,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 50 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-22 23:20:51,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-22 23:20:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-22 23:20:51,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-22 23:20:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-22 23:20:51,050 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-22 23:20:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:51,050 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-22 23:20:51,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-22 23:20:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-22 23:20:51,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-22 23:20:51,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:51,051 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-22 23:20:51,051 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:51,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2018-11-22 23:20:51,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:51,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,054 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:51,126 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-22 23:20:51,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:51,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:51,126 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:51,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:51,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:51,126 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:51,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:51,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:20:51,155 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:51,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:51,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:51,182 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-22 23:20:51,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:51,271 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-22 23:20:51,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:51,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-22 23:20:51,287 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:51,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-22 23:20:51,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-22 23:20:51,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-22 23:20:51,288 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-11-22 23:20:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:51,317 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-22 23:20:51,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-22 23:20:51,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-22 23:20:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:51,318 INFO L225 Difference]: With dead ends: 46 [2018-11-22 23:20:51,318 INFO L226 Difference]: Without dead ends: 34 [2018-11-22 23:20:51,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 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-22 23:20:51,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-22 23:20:51,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-22 23:20:51,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-22 23:20:51,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-22 23:20:51,326 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-22 23:20:51,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:51,327 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-22 23:20:51,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-22 23:20:51,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-22 23:20:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-22 23:20:51,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:51,328 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-22 23:20:51,328 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:51,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2018-11-22 23:20:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:51,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:51,427 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-22 23:20:51,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:51,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:51,428 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:51,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:51,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:51,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:51,434 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:51,434 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:20:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:51,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:51,457 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-22 23:20:51,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:51,536 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-22 23:20:51,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:51,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-22 23:20:51,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:51,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-22 23:20:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-22 23:20:51,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:20:51,552 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-22 23:20:51,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:51,577 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-22 23:20:51,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-22 23:20:51,582 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-22 23:20:51,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:51,583 INFO L225 Difference]: With dead ends: 48 [2018-11-22 23:20:51,583 INFO L226 Difference]: Without dead ends: 36 [2018-11-22 23:20:51,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:20:51,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-22 23:20:51,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-22 23:20:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-22 23:20:51,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-22 23:20:51,595 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-22 23:20:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:51,596 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-22 23:20:51,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-22 23:20:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-22 23:20:51,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-22 23:20:51,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:51,596 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-22 23:20:51,596 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:51,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:51,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2018-11-22 23:20:51,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:51,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:51,687 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-22 23:20:51,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:51,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:51,687 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:51,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:51,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:51,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:51,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:51,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:20:51,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-22 23:20:51,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:51,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:51,800 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-22 23:20:51,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:51,882 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-22 23:20:51,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:51,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-22 23:20:51,898 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:51,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-22 23:20:51,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-22 23:20:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-22 23:20:51,898 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-22 23:20:51,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:51,921 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-22 23:20:51,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-22 23:20:51,922 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-22 23:20:51,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:51,922 INFO L225 Difference]: With dead ends: 50 [2018-11-22 23:20:51,922 INFO L226 Difference]: Without dead ends: 38 [2018-11-22 23:20:51,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-22 23:20:51,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-22 23:20:51,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-22 23:20:51,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-22 23:20:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-22 23:20:51,926 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-22 23:20:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:51,926 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-22 23:20:51,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-22 23:20:51,926 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-22 23:20:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-22 23:20:51,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:51,927 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-22 23:20:51,927 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:51,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:51,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2018-11-22 23:20:51,927 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:51,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:51,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:51,928 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,017 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-22 23:20:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:52,018 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:52,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:52,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:52,027 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:52,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:20:52,043 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:52,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:52,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,083 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-22 23:20:52,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:52,196 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-22 23:20:52,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:52,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-22 23:20:52,212 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:52,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-22 23:20:52,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 23:20:52,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:52,213 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-22 23:20:52,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:52,238 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-22 23:20:52,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-22 23:20:52,239 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-22 23:20:52,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:52,240 INFO L225 Difference]: With dead ends: 52 [2018-11-22 23:20:52,240 INFO L226 Difference]: Without dead ends: 40 [2018-11-22 23:20:52,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:52,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-22 23:20:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-22 23:20:52,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-22 23:20:52,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-22 23:20:52,242 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-11-22 23:20:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:52,243 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-22 23:20:52,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-22 23:20:52,243 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-22 23:20:52,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-22 23:20:52,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:52,243 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-22 23:20:52,244 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:52,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,244 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2018-11-22 23:20:52,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:52,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:52,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,323 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-22 23:20:52,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:52,323 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:52,323 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:52,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:52,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,330 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:20:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,362 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-22 23:20:52,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:52,531 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-22 23:20:52,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:52,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2018-11-22 23:20:52,555 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:52,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-22 23:20:52,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-22 23:20:52,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:52,556 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2018-11-22 23:20:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:52,582 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-22 23:20:52,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 23:20:52,583 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-22 23:20:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:52,583 INFO L225 Difference]: With dead ends: 54 [2018-11-22 23:20:52,583 INFO L226 Difference]: Without dead ends: 42 [2018-11-22 23:20:52,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:52,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-22 23:20:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-22 23:20:52,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-22 23:20:52,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-22 23:20:52,587 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-22 23:20:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:52,587 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-22 23:20:52,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-22 23:20:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-22 23:20:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-22 23:20:52,588 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:52,588 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-22 23:20:52,588 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:52,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2018-11-22 23:20:52,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:52,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:52,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:52,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:52,684 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-22 23:20:52,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:52,685 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:52,685 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:52,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:52,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:52,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:20:52,874 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-22 23:20:52,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:52,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:52,891 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-22 23:20:52,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:52,997 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-22 23:20:53,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:53,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 23 [2018-11-22 23:20:53,023 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:53,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-22 23:20:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-22 23:20:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:53,024 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2018-11-22 23:20:53,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,057 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-22 23:20:53,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-22 23:20:53,058 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-22 23:20:53,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:53,058 INFO L225 Difference]: With dead ends: 56 [2018-11-22 23:20:53,058 INFO L226 Difference]: Without dead ends: 44 [2018-11-22 23:20:53,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:53,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-22 23:20:53,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-22 23:20:53,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-22 23:20:53,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-22 23:20:53,064 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-11-22 23:20:53,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:53,065 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-22 23:20:53,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-22 23:20:53,065 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-22 23:20:53,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-22 23:20:53,065 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:53,066 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-22 23:20:53,066 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:53,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,068 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2018-11-22 23:20:53,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,168 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-22 23:20:53,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,168 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:53,168 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:53,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:53,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:53,180 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:53,180 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:20:53,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:53,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:53,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:53,228 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-22 23:20:53,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:53,357 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-22 23:20:53,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:53,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 23 [2018-11-22 23:20:53,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:53,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-22 23:20:53,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-22 23:20:53,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:53,374 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 16 states. [2018-11-22 23:20:53,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,406 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-22 23:20:53,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 23:20:53,407 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-22 23:20:53,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:53,408 INFO L225 Difference]: With dead ends: 58 [2018-11-22 23:20:53,408 INFO L226 Difference]: Without dead ends: 46 [2018-11-22 23:20:53,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:53,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-22 23:20:53,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-22 23:20:53,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-22 23:20:53,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-22 23:20:53,412 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-11-22 23:20:53,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:53,412 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-22 23:20:53,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-22 23:20:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-22 23:20:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-22 23:20:53,413 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:53,413 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-22 23:20:53,413 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:53,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2018-11-22 23:20:53,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:53,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:53,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,572 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-22 23:20:53,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:53,572 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:53,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:53,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:53,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:53,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:20:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:53,633 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-22 23:20:53,633 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:53,764 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-22 23:20:53,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:53,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2018-11-22 23:20:53,779 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:53,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-22 23:20:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 23:20:53,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:53,780 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-11-22 23:20:53,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:53,814 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-22 23:20:53,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 23:20:53,814 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-22 23:20:53,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:53,814 INFO L225 Difference]: With dead ends: 60 [2018-11-22 23:20:53,815 INFO L226 Difference]: Without dead ends: 48 [2018-11-22 23:20:53,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 74 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:53,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-22 23:20:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-22 23:20:53,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-22 23:20:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-22 23:20:53,820 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-11-22 23:20:53,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:53,820 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-22 23:20:53,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-22 23:20:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-22 23:20:53,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-22 23:20:53,821 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:53,821 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-22 23:20:53,821 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:53,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2018-11-22 23:20:53,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:53,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:53,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:53,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:53,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:53,912 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-22 23:20:53,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:53,913 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:53,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:53,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:53,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:53,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:53,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:20:55,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-22 23:20:55,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:55,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:55,115 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-22 23:20:55,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:55,227 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-22 23:20:55,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:55,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2018-11-22 23:20:55,244 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:55,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-22 23:20:55,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-22 23:20:55,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:55,245 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2018-11-22 23:20:55,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:55,283 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-22 23:20:55,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-22 23:20:55,283 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-11-22 23:20:55,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:55,284 INFO L225 Difference]: With dead ends: 62 [2018-11-22 23:20:55,284 INFO L226 Difference]: Without dead ends: 50 [2018-11-22 23:20:55,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 77 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-22 23:20:55,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-22 23:20:55,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-22 23:20:55,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-22 23:20:55,287 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-11-22 23:20:55,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:55,287 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-22 23:20:55,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-22 23:20:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-22 23:20:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-22 23:20:55,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:55,288 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-22 23:20:55,288 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:55,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,288 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2018-11-22 23:20:55,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:55,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:55,412 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-22 23:20:55,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:55,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:55,412 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:55,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:55,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:55,412 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:55,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:20:55,419 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:20:55,435 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:20:55,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:55,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:55,445 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-22 23:20:55,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:55,589 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-22 23:20:55,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:55,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 23 [2018-11-22 23:20:55,604 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:55,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-22 23:20:55,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 23:20:55,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:55,605 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2018-11-22 23:20:55,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:55,631 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-22 23:20:55,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-22 23:20:55,631 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-22 23:20:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:55,631 INFO L225 Difference]: With dead ends: 64 [2018-11-22 23:20:55,632 INFO L226 Difference]: Without dead ends: 52 [2018-11-22 23:20:55,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 80 SyntacticMatches, 12 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:55,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-22 23:20:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-22 23:20:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-22 23:20:55,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-22 23:20:55,635 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-11-22 23:20:55,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:55,635 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-22 23:20:55,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-22 23:20:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-22 23:20:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-22 23:20:55,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:55,636 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-22 23:20:55,636 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:55,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2018-11-22 23:20:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:55,777 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-22 23:20:55,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:55,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:55,778 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:55,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:55,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:55,778 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:55,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:55,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:20:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:55,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:55,809 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-22 23:20:55,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:55,916 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-22 23:20:55,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:55,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 23 [2018-11-22 23:20:55,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:55,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-22 23:20:55,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-22 23:20:55,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:55,932 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 20 states. [2018-11-22 23:20:55,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:55,968 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-22 23:20:55,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-22 23:20:55,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-11-22 23:20:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:55,970 INFO L225 Difference]: With dead ends: 66 [2018-11-22 23:20:55,970 INFO L226 Difference]: Without dead ends: 54 [2018-11-22 23:20:55,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 83 SyntacticMatches, 14 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:55,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-22 23:20:55,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-22 23:20:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-22 23:20:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-22 23:20:55,974 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-11-22 23:20:55,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:55,974 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-22 23:20:55,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-22 23:20:55,974 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-22 23:20:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-22 23:20:55,975 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:55,975 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-22 23:20:55,975 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:55,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:55,975 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2018-11-22 23:20:55,975 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:20:55,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:55,976 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:20:56,102 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-22 23:20:56,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:56,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:20:56,102 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:20:56,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:20:56,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:20:56,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:20:56,118 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:20:56,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-22 23:20:59,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-22 23:20:59,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:20:59,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:20:59,654 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-22 23:20:59,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:20:59,806 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-22 23:20:59,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:20:59,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 23 [2018-11-22 23:20:59,823 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:20:59,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-22 23:20:59,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-22 23:20:59,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:59,824 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 21 states. [2018-11-22 23:20:59,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:20:59,861 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-22 23:20:59,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-22 23:20:59,861 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-11-22 23:20:59,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:20:59,862 INFO L225 Difference]: With dead ends: 68 [2018-11-22 23:20:59,862 INFO L226 Difference]: Without dead ends: 56 [2018-11-22 23:20:59,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 16 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:20:59,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-22 23:20:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-22 23:20:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-22 23:20:59,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-22 23:20:59,865 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-11-22 23:20:59,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:20:59,865 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-22 23:20:59,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-22 23:20:59,865 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-22 23:20:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-22 23:20:59,866 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:20:59,866 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-22 23:20:59,866 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:20:59,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:20:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2018-11-22 23:20:59,866 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:20:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:59,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:20:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:20:59,867 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:20:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:21:00,005 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-22 23:21:00,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:21:00,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:21:00,005 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:21:00,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:21:00,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:21:00,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:21:00,012 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-22 23:21:00,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-22 23:21:00,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-22 23:21:00,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:21:00,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:21:00,039 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-22 23:21:00,039 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:21:00,164 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-22 23:21:00,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:21:00,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 23 [2018-11-22 23:21:00,179 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:21:00,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-22 23:21:00,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-22 23:21:00,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:21:00,180 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 22 states. [2018-11-22 23:21:00,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:21:00,219 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-22 23:21:00,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-22 23:21:00,220 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-11-22 23:21:00,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:21:00,220 INFO L225 Difference]: With dead ends: 70 [2018-11-22 23:21:00,220 INFO L226 Difference]: Without dead ends: 58 [2018-11-22 23:21:00,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 89 SyntacticMatches, 18 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:21:00,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-22 23:21:00,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-22 23:21:00,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-22 23:21:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-22 23:21:00,223 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-11-22 23:21:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:21:00,223 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-22 23:21:00,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-22 23:21:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-22 23:21:00,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-22 23:21:00,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:21:00,224 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-22 23:21:00,224 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:21:00,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:21:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2018-11-22 23:21:00,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:21:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:21:00,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:21:00,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:21:00,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:21:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:21:00,422 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-22 23:21:00,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:21:00,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-22 23:21:00,422 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-22 23:21:00,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-22 23:21:00,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:21:00,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/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-22 23:21:00,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:21:00,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-22 23:21:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:21:00,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:21:00,477 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-22 23:21:00,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-22 23:21:00,589 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-22 23:21:00,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-22 23:21:00,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 23 [2018-11-22 23:21:00,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-22 23:21:00,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-22 23:21:00,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-22 23:21:00,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:21:00,604 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 23 states. [2018-11-22 23:21:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:21:00,636 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-22 23:21:00,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-22 23:21:00,636 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-11-22 23:21:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-22 23:21:00,637 INFO L225 Difference]: With dead ends: 71 [2018-11-22 23:21:00,637 INFO L226 Difference]: Without dead ends: 59 [2018-11-22 23:21:00,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-22 23:21:00,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-22 23:21:00,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-22 23:21:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-22 23:21:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-22 23:21:00,639 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-11-22 23:21:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-22 23:21:00,639 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-22 23:21:00,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-22 23:21:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-22 23:21:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-22 23:21:00,640 INFO L394 BasicCegarLoop]: Found error trace [2018-11-22 23:21:00,640 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-22 23:21:00,640 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-22 23:21:00,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:21:00,640 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2018-11-22 23:21:00,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-22 23:21:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:21:00,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:21:00,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:21:00,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-22 23:21:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:21:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:21:00,719 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-22 23:21:01,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:21:01 BoogieIcfgContainer [2018-11-22 23:21:01,062 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-22 23:21:01,063 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 23:21:01,063 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 23:21:01,063 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 23:21:01,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:20:49" (3/4) ... [2018-11-22 23:21:01,065 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-22 23:21:01,879 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_448117b6-72d7-4f9c-a94c-8040e959a9d0/bin-2019/utaipan/witness.graphml [2018-11-22 23:21:01,879 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 23:21:01,879 INFO L168 Benchmark]: Toolchain (without parser) took 12771.05 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 318.2 MB). Free memory was 959.2 MB in the beginning and 961.1 MB in the end (delta: -1.9 MB). Peak memory consumption was 316.4 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,881 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:21:01,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,881 INFO L168 Benchmark]: Boogie Preprocessor took 51.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,882 INFO L168 Benchmark]: RCFGBuilder took 163.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,882 INFO L168 Benchmark]: TraceAbstraction took 11541.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 976.7 MB in the end (delta: 143.0 MB). Peak memory consumption was 320.8 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,882 INFO L168 Benchmark]: Witness Printer took 816.14 ms. Allocated memory is still 1.3 GB. Free memory was 976.7 MB in the beginning and 961.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:21:01,883 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.50 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 948.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.79 ms. Allocated memory is still 1.0 GB. Free memory was 948.5 MB in the beginning and 945.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -188.9 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 163.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11541.49 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 177.7 MB). Free memory was 1.1 GB in the beginning and 976.7 MB in the end (delta: 143.0 MB). Peak memory consumption was 320.8 MB. Max. memory is 11.5 GB. * Witness Printer took 816.14 ms. Allocated memory is still 1.3 GB. Free memory was 976.7 MB in the beginning and 961.1 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 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, 11.4s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 210 SDslu, 3009 SDs, 0 SdLazy, 658 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1677 GetRequests, 1239 SyntacticMatches, 110 SemanticMatches, 328 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.2s 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.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 104 NumberOfCheckSat, 2142 ConstructedInterpolants, 0 QuantifiedInterpolants, 187710 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 59 InterpolantComputations, 2 PerfectInterpolantSequences, 0/7410 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...