./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.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_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d15e59fd1b84d7219285b33cc166f567d0bcf3e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-23 03:47:39,977 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:47:39,978 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:47:39,987 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:47:39,987 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:47:39,988 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:47:39,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:47:39,990 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:47:39,991 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:47:39,991 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:47:39,992 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:47:39,992 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:47:39,993 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:47:39,993 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:47:39,994 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:47:39,994 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:47:39,995 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:47:39,996 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:47:39,998 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:47:39,999 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:47:39,999 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:47:40,000 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:47:40,002 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:47:40,002 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:47:40,002 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:47:40,003 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:47:40,003 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:47:40,004 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:47:40,004 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:47:40,005 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:47:40,005 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:47:40,006 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:47:40,006 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:47:40,006 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:47:40,007 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:47:40,007 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:47:40,007 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 03:47:40,017 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:47:40,017 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:47:40,018 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 03:47:40,018 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 03:47:40,018 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:47:40,019 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:47:40,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 03:47:40,020 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 03:47:40,020 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 03:47:40,020 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:47:40,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:47:40,020 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:47:40,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 03:47:40,020 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:47:40,021 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 03:47:40,021 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:47:40,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 03:47:40,022 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 03:47:40,022 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer 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 -> Automizer 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 -> 8d15e59fd1b84d7219285b33cc166f567d0bcf3e [2018-11-23 03:47:40,044 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:47:40,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:47:40,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:47:40,057 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:47:40,058 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:47:40,058 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-23 03:47:40,099 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/data/7a405836b/0e5093220c1a460d83466f435b20f3df/FLAG66b09730a [2018-11-23 03:47:40,423 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:47:40,424 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/sv-benchmarks/c/ldv-regression/test27_false-unreach-call_true-termination.c [2018-11-23 03:47:40,429 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/data/7a405836b/0e5093220c1a460d83466f435b20f3df/FLAG66b09730a [2018-11-23 03:47:40,858 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/data/7a405836b/0e5093220c1a460d83466f435b20f3df [2018-11-23 03:47:40,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:47:40,862 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:47:40,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:47:40,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:47:40,865 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:47:40,866 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:47:40" (1/1) ... [2018-11-23 03:47:40,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3709085a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:40, skipping insertion in model container [2018-11-23 03:47:40,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:47:40" (1/1) ... [2018-11-23 03:47:40,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:47:40,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:47:41,005 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:47:41,011 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:47:41,026 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:47:41,036 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:47:41,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41 WrapperNode [2018-11-23 03:47:41,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:47:41,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:47:41,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:47:41,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:47:41,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:47:41,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:47:41,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:47:41,054 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:47:41,060 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,060 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... [2018-11-23 03:47:41,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:47:41,118 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:47:41,118 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:47:41,118 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:47:41,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 03:47:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 03:47:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 03:47:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 03:47:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 03:47:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 03:47:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 03:47:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 03:47:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 03:47:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 03:47:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 03:47:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:47:41,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:47:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 03:47:41,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 03:47:41,342 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:47:41,342 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 03:47:41,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:41 BoogieIcfgContainer [2018-11-23 03:47:41,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:47:41,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 03:47:41,344 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 03:47:41,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 03:47:41,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:47:40" (1/3) ... [2018-11-23 03:47:41,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54262be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:47:41, skipping insertion in model container [2018-11-23 03:47:41,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:47:41" (2/3) ... [2018-11-23 03:47:41,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54262be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:47:41, skipping insertion in model container [2018-11-23 03:47:41,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:41" (3/3) ... [2018-11-23 03:47:41,349 INFO L112 eAbstractionObserver]: Analyzing ICFG test27_false-unreach-call_true-termination.c [2018-11-23 03:47:41,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 03:47:41,364 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 03:47:41,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 03:47:41,406 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:47:41,406 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 03:47:41,407 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 03:47:41,407 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 03:47:41,407 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:47:41,407 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:47:41,407 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 03:47:41,407 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:47:41,407 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 03:47:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 03:47:41,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 03:47:41,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:41,428 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:41,430 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:41,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:41,435 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2018-11-23 03:47:41,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:41,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:41,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:41,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:41,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:47:41,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:47:41,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 03:47:41,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 03:47:41,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:47:41,550 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 03:47:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:41,562 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-23 03:47:41,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 03:47:41,563 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 03:47:41,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:41,569 INFO L225 Difference]: With dead ends: 42 [2018-11-23 03:47:41,569 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 03:47:41,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 03:47:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 03:47:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 03:47:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 03:47:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 03:47:41,595 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 03:47:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:41,596 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 03:47:41,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 03:47:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 03:47:41,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 03:47:41,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:41,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:41,597 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:41,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:41,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2018-11-23 03:47:41,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:41,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:41,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:41,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:41,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:47:41,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:47:41,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 03:47:41,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:47:41,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:47:41,660 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 03:47:41,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:41,678 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 03:47:41,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:47:41,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 03:47:41,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:41,679 INFO L225 Difference]: With dead ends: 34 [2018-11-23 03:47:41,679 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 03:47:41,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:47:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 03:47:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 03:47:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 03:47:41,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 03:47:41,683 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 03:47:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:41,683 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 03:47:41,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 03:47:41,683 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 03:47:41,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 03:47:41,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:41,683 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:41,683 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:41,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:41,684 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2018-11-23 03:47:41,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:41,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:41,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:41,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:41,736 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:41,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:41,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:41,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:41,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 03:47:41,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 03:47:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 03:47:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:47:41,838 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 03:47:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:41,870 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 03:47:41,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:47:41,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 03:47:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:41,872 INFO L225 Difference]: With dead ends: 36 [2018-11-23 03:47:41,872 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 03:47:41,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 03:47:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 03:47:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 03:47:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 03:47:41,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 03:47:41,875 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 03:47:41,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:41,876 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 03:47:41,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 03:47:41,876 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 03:47:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 03:47:41,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:41,877 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:41,877 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:41,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2018-11-23 03:47:41,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:41,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:41,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:41,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:41,940 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:41,951 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:47:41,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:47:41,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:47:41,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:42,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:42,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 03:47:42,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 03:47:42,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 03:47:42,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:47:42,013 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-23 03:47:42,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:42,040 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 03:47:42,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 03:47:42,041 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 03:47:42,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:42,041 INFO L225 Difference]: With dead ends: 38 [2018-11-23 03:47:42,042 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 03:47:42,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 03:47:42,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 03:47:42,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 03:47:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 03:47:42,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 03:47:42,046 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-23 03:47:42,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:42,046 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 03:47:42,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 03:47:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 03:47:42,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 03:47:42,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:42,047 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:42,047 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:42,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:42,048 INFO L82 PathProgramCache]: Analyzing trace with hash 2113766385, now seen corresponding path program 3 times [2018-11-23 03:47:42,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:42,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:42,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:42,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:47:42,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:42,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:42,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:42,136 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:47:42,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 03:47:42,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:47:42,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:42,292 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:42,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:42,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 03:47:42,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 03:47:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 03:47:42,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:47:42,319 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-11-23 03:47:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:42,379 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 03:47:42,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 03:47:42,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 03:47:42,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:42,382 INFO L225 Difference]: With dead ends: 40 [2018-11-23 03:47:42,382 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 03:47:42,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 03:47:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 03:47:42,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 03:47:42,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 03:47:42,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 03:47:42,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-23 03:47:42,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:42,388 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 03:47:42,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 03:47:42,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 03:47:42,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 03:47:42,388 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:42,389 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:42,389 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:42,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:42,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1818492333, now seen corresponding path program 4 times [2018-11-23 03:47:42,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:42,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:42,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:47:42,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:42,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:42,463 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:42,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 03:47:42,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 03:47:42,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:47:42,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:42,530 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:42,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:42,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 03:47:42,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 03:47:42,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 03:47:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:47:42,555 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-23 03:47:42,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:42,598 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 03:47:42,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 03:47:42,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 03:47:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:42,600 INFO L225 Difference]: With dead ends: 42 [2018-11-23 03:47:42,601 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 03:47:42,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 03:47:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 03:47:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 03:47:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 03:47:42,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 03:47:42,605 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 03:47:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:42,605 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 03:47:42,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 03:47:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 03:47:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 03:47:42,606 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:42,606 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:42,606 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:42,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:42,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1147899851, now seen corresponding path program 5 times [2018-11-23 03:47:42,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:42,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:47:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:42,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:42,679 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:42,690 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 03:47:43,652 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 03:47:43,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:47:43,656 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:43,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:43,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:43,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 03:47:43,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 03:47:43,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 03:47:43,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:47:43,692 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-23 03:47:43,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:43,722 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 03:47:43,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 03:47:43,722 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 03:47:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:43,723 INFO L225 Difference]: With dead ends: 44 [2018-11-23 03:47:43,723 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 03:47:43,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 03:47:43,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 03:47:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 03:47:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 03:47:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 03:47:43,726 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 03:47:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:43,727 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 03:47:43,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 03:47:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 03:47:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 03:47:43,727 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:43,727 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:43,728 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:43,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:43,728 INFO L82 PathProgramCache]: Analyzing trace with hash -953619049, now seen corresponding path program 6 times [2018-11-23 03:47:43,728 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:43,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:43,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:47:43,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:43,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:43,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:43,815 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:43,821 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 03:47:46,399 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 03:47:46,399 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:47:46,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:46,414 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:46,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:46,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 03:47:46,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 03:47:46,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:47:46,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:47:46,432 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-11-23 03:47:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:46,459 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 03:47:46,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 03:47:46,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 03:47:46,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:46,460 INFO L225 Difference]: With dead ends: 46 [2018-11-23 03:47:46,460 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 03:47:46,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:47:46,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 03:47:46,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 03:47:46,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 03:47:46,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 03:47:46,463 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-23 03:47:46,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:46,464 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 03:47:46,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 03:47:46,464 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 03:47:46,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 03:47:46,464 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:46,464 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:46,465 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:46,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:46,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1066637945, now seen corresponding path program 7 times [2018-11-23 03:47:46,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:46,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:46,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:46,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:47:46,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:46,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:46,554 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:46,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:46,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:46,606 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:46,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:46,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 03:47:46,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 03:47:46,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 03:47:46,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:47:46,622 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 03:47:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:46,649 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 03:47:46,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:47:46,650 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 03:47:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:46,651 INFO L225 Difference]: With dead ends: 48 [2018-11-23 03:47:46,651 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 03:47:46,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 03:47:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 03:47:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 03:47:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 03:47:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 03:47:46,656 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-23 03:47:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:46,656 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 03:47:46,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 03:47:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 03:47:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 03:47:46,657 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:46,657 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:46,657 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:46,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:46,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1208391387, now seen corresponding path program 8 times [2018-11-23 03:47:46,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:46,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:46,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:46,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:47:46,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:46,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:46,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 03:47:46,789 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 03:47:46,789 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:47:46,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:47:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:46,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:47:46,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 03:47:46,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 03:47:46,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 03:47:46,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:47:46,820 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-23 03:47:46,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:47:46,854 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 03:47:46,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 03:47:46,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 03:47:46,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:47:46,856 INFO L225 Difference]: With dead ends: 50 [2018-11-23 03:47:46,856 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 03:47:46,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 03:47:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 03:47:46,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 03:47:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 03:47:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 03:47:46,859 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-23 03:47:46,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:47:46,859 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 03:47:46,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 03:47:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 03:47:46,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 03:47:46,860 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:47:46,860 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:47:46,860 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:47:46,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:47:46,860 INFO L82 PathProgramCache]: Analyzing trace with hash -5504323, now seen corresponding path program 9 times [2018-11-23 03:47:46,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:47:46,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:47:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:46,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:47:46,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:47:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:47:46,965 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:47:46,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 03:47:46,965 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 03:47:46,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 03:48:03,328 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 03:48:03,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 03:48:03,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 03:48:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:48:03,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 03:48:03,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 03:48:03,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 03:48:03,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 03:48:03,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:48:03,371 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-23 03:48:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:48:03,400 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 03:48:03,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 03:48:03,400 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 03:48:03,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 03:48:03,400 INFO L225 Difference]: With dead ends: 51 [2018-11-23 03:48:03,400 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 03:48:03,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 03:48:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 03:48:03,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 03:48:03,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 03:48:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 03:48:03,404 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-11-23 03:48:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 03:48:03,404 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 03:48:03,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 03:48:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 03:48:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 03:48:03,405 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 03:48:03,405 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:48:03,405 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 03:48:03,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:48:03,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1671822879, now seen corresponding path program 10 times [2018-11-23 03:48:03,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:48:03,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:48:03,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:48:03,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:48:03,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:48:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:48:03,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:48:03,739 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=62, |#NULL.offset|=89, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem11|=1, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem15|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~i~0 < #t~mem15);havoc #t~mem15; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset;havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume 0 == #t~ret17;havoc #t~ret17; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !false; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] ----- [2018-11-23 03:48:03,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:48:03 BoogieIcfgContainer [2018-11-23 03:48:03,899 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 03:48:03,900 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:48:03,900 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:48:03,900 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:48:03,900 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:47:41" (3/4) ... [2018-11-23 03:48:03,903 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|=62, |#NULL.offset|=89, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=62, |old(#NULL.offset)|=89] [?] RET #58#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret18 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !!(~j~0 < 10);assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4);havoc #t~nondet7.base, #t~nondet7.offset; VAL [main_~i~0=1, main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~j~0 < 10); VAL [main_~i~0=1, main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 9;call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4);~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0;havoc #t~mem10.base, #t~mem10.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem9.base, #t~mem9.offset;call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [main_~i~0=1, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem11|=1, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume #t~mem11 > 0;havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4);call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4);~i~0 := #t~mem14 - 10;havoc #t~mem14;havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem15|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !(~i~0 < #t~mem15);havoc #t~mem15; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0] [?] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4);call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4);#res := (if #t~mem3 == ~i then 1 else 0);havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem2.base, #t~mem2.offset;havoc #t~mem3;havoc #t~mem1.base, #t~mem1.offset; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] assume true; VAL [check_~i=0, check_~pc.base=72, check_~pc.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~i|=0, |check_#in~pc.base|=72, |check_#in~pc.offset|=0, |check_#res|=0] [?] RET #62#return; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret17|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume 0 == #t~ret17;havoc #t~ret17; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] assume !false; VAL [main_~i~0=0, main_~j~0=10, main_~pa~0.base=57, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#a~0.base|=102, |main_~#a~0.offset|=0, |main_~#cont~0.base|=72, |main_~#cont~0.offset|=0, |main_~#dummies~0.base|=56, |main_~#dummies~0.offset|=0, |main_~#dummy~0.base|=101, |main_~#dummy~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=62, #NULL.offset=89, old(#NULL.base)=62, old(#NULL.offset)=89] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=62, old(#NULL.offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L22] call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4); [L23] call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4); [L24] call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40); [L25] call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0.base, ~pa~0.offset; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28-L31] assume !!(~j~0 < 10); [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] call write~int(#t~nondet6, ~#a~0.base, ~#a~0.offset + 4 * ~j~0, 4); [L29] havoc #t~nondet6; [L30] call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * ~j~0, 4); [L30] havoc #t~nondet7.base, #t~nondet7.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L28-L31] assume !(~j~0 < 10); VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10] [L32-L47] assume ~i~0 >= 0 && ~i~0 < 9; [L33] call write~int(~i~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); [L34] call write~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~0, ~#dummy~0.base, ~#dummy~0.offset, 4); [L35] call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L36] call write~$Pointer$(~#dummies~0.base, ~#dummies~0.offset, ~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4); [L37] call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, #t~mem8.offset + 4 * ~i~0, 4); [L37] call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4); [L37] ~pa~0.base, ~pa~0.offset := #t~mem10.base, #t~mem10.offset + 4 * ~i~0; [L37] havoc #t~mem10.base, #t~mem10.offset; [L37] havoc #t~mem8.base, #t~mem8.offset; [L37] havoc #t~mem9.base, #t~mem9.offset; [L38] call #t~mem11 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem11=1, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=1, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L38-L46] assume #t~mem11 > 0; [L38] havoc #t~mem11; [L39] call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~#dummies~0.offset + 4 * (1 + ~i~0), 4); [L39] call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4); [L39] call #t~mem14 := read~int(#t~mem13.base, #t~mem13.offset + 4 * ~i~0, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12.base, #t~mem12.offset; [L39] havoc #t~mem13.base, #t~mem13.offset; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40] call #t~mem15 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem15=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L40-L42] assume !(~i~0 < #t~mem15); [L40] havoc #t~mem15; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] CALL call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0] [L15-L18] ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset; [L15-L18] ~i := #in~i; [L17] call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4); [L17] call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, #t~mem0.offset + 4 * ~i, 4); [L17] call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4); [L17] call #t~mem3 := read~int(#t~mem2.base, #t~mem2.offset + 4 * ~i, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0.base, #t~mem0.offset; [L17] havoc #t~mem2.base, #t~mem2.offset; [L17] havoc #t~mem3; [L17] havoc #t~mem1.base, #t~mem1.offset; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L15-L18] ensures true; VAL [#in~i=0, #in~pc.base=72, #in~pc.offset=0, #NULL.base=0, #NULL.offset=0, #res=0, ~i=0, ~pc.base=72, ~pc.offset=0] [L43] RET call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret17=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L43-L45] assume 0 == #t~ret17; [L43] havoc #t~ret17; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [L51] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#a~0.base=102, ~#a~0.offset=0, ~#cont~0.base=72, ~#cont~0.offset=0, ~#dummies~0.base=56, ~#dummies~0.offset=0, ~#dummy~0.base=101, ~#dummy~0.offset=0, ~i~0=0, ~j~0=10, ~pa~0.base=57, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=62, #NULL!offset=89, old(#NULL!base)=62, old(#NULL!offset)=89] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=62, old(#NULL!offset)=89] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret18 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L22] FCALL call ~#cont~0 := #Ultimate.alloc(4); [L23] FCALL call ~#dummy~0 := #Ultimate.alloc(4); [L24] FCALL call ~#dummies~0 := #Ultimate.alloc(40); [L25] FCALL call ~#a~0 := #Ultimate.alloc(40); [L26] havoc ~i~0; [L26] havoc ~pa~0; [L27] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L27] ~i~0 := #t~nondet4; [L27] havoc #t~nondet4; [L28] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=0] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=1] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=2] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=3] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=4] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=5] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=6] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=7] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=8] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28-L31] COND FALSE !(!(~j~0 < 10)) [L29] assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647; [L29] FCALL call write~int(#t~nondet6, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~j~0 }, 4); [L29] havoc #t~nondet6; [L30] FCALL call write~$Pointer$(#t~nondet7, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * ~j~0 }, 4); [L30] havoc #t~nondet7; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=9] [L28] #t~post5 := ~j~0; [L28] ~j~0 := 1 + #t~post5; [L28] havoc #t~post5; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L28-L31] COND TRUE !(~j~0 < 10) VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10] [L32] COND TRUE ~i~0 >= 0 && ~i~0 < 9 [L33] FCALL call write~int(~i~0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L34] FCALL call write~$Pointer$({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, { base: ~#dummy~0!base, offset: ~#dummy~0!offset }, 4); [L35] FCALL call write~$Pointer$(~#dummy~0, { base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L36] FCALL call write~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset }, { base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem8 := read~$Pointer$({ base: ~#cont~0!base, offset: ~#cont~0!offset }, 4); [L37] FCALL call #t~mem9 := read~$Pointer$({ base: #t~mem8!base, offset: #t~mem8!offset + 4 * ~i~0 }, 4); [L37] FCALL call #t~mem10 := read~$Pointer$({ base: #t~mem9!base, offset: #t~mem9!offset }, 4); [L37] ~pa~0 := { base: #t~mem10!base, offset: #t~mem10!offset + 4 * ~i~0 }; [L37] havoc #t~mem10; [L37] havoc #t~mem8; [L37] havoc #t~mem9; [L38] FCALL call #t~mem11 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem11=1, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=1, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L38] COND TRUE #t~mem11 > 0 [L38] havoc #t~mem11; [L39] FCALL call #t~mem12 := read~$Pointer$({ base: ~#dummies~0!base, offset: ~#dummies~0!offset + 4 * (1 + ~i~0) }, 4); [L39] FCALL call #t~mem13 := read~$Pointer$({ base: #t~mem12!base, offset: #t~mem12!offset }, 4); [L39] FCALL call #t~mem14 := read~int({ base: #t~mem13!base, offset: #t~mem13!offset + 4 * ~i~0 }, 4); [L39] ~i~0 := #t~mem14 - 10; [L39] havoc #t~mem14; [L39] havoc #t~mem12; [L39] havoc #t~mem13; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40] FCALL call #t~mem15 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem15=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L40-L42] COND TRUE !(~i~0 < #t~mem15) [L40] havoc #t~mem15; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] CALL call #t~ret17 := check(~#cont~0, ~i~0); VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0] [L15-L18] ~pc := #in~pc; [L15-L18] ~i := #in~i; [L17] FCALL call #t~mem0 := read~$Pointer$({ base: ~pc!base, offset: ~pc!offset }, 4); [L17] FCALL call #t~mem1 := read~$Pointer$({ base: #t~mem0!base, offset: #t~mem0!offset + 4 * ~i }, 4); [L17] FCALL call #t~mem2 := read~$Pointer$({ base: #t~mem1!base, offset: #t~mem1!offset }, 4); [L17] FCALL call #t~mem3 := read~int({ base: #t~mem2!base, offset: #t~mem2!offset + 4 * ~i }, 4); [L17] #res := (if #t~mem3 == ~i then 1 else 0); [L17] havoc #t~mem0; [L17] havoc #t~mem2; [L17] havoc #t~mem3; [L17] havoc #t~mem1; VAL [#in~i=0, #in~pc!base=72, #in~pc!offset=0, #NULL!base=0, #NULL!offset=0, #res=0, ~i=0, ~pc!base=72, ~pc!offset=0] [L43] RET call #t~ret17 := check(~#cont~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] assume -2147483648 <= #t~ret17 && #t~ret17 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret17=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L43] COND TRUE 0 == #t~ret17 [L43] havoc #t~ret17; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L51] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#a~0!base=102, ~#a~0!offset=0, ~#cont~0!base=72, ~#cont~0!offset=0, ~#dummies~0!base=56, ~#dummies~0!offset=0, ~#dummy~0!base=101, ~#dummy~0!offset=0, ~i~0=0, ~j~0=10, ~pa~0!base=57, ~pa~0!offset=0] [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] ----- [2018-11-23 03:48:04,332 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1bc2bb87-27e8-41d5-ba93-0c345117f8ff/bin-2019/uautomizer/witness.graphml [2018-11-23 03:48:04,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:48:04,333 INFO L168 Benchmark]: Toolchain (without parser) took 23471.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.9 MB). Free memory was 959.1 MB in the beginning and 987.4 MB in the end (delta: -28.3 MB). Peak memory consumption was 153.7 MB. Max. memory is 11.5 GB. [2018-11-23 03:48:04,334 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:48:04,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 174.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-11-23 03:48:04,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.85 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:48:04,335 INFO L168 Benchmark]: Boogie Preprocessor took 63.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:48:04,335 INFO L168 Benchmark]: RCFGBuilder took 224.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:48:04,335 INFO L168 Benchmark]: TraceAbstraction took 22555.98 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 76.8 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. [2018-11-23 03:48:04,336 INFO L168 Benchmark]: Witness Printer took 432.46 ms. Allocated memory is still 1.2 GB. Free memory was 997.9 MB in the beginning and 987.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2018-11-23 03:48:04,342 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 174.51 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 945.5 MB in the end (delta: 13.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.85 ms. Allocated memory is still 1.0 GB. Free memory is still 945.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -151.3 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 224.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22555.98 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 81.3 MB). Free memory was 1.1 GB in the beginning and 997.9 MB in the end (delta: 76.8 MB). Peak memory consumption was 158.1 MB. Max. memory is 11.5 GB. * Witness Printer took 432.46 ms. Allocated memory is still 1.2 GB. Free memory was 997.9 MB in the beginning and 987.4 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 51]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L22] struct cont cont; [L23] struct dummy dummy; [L24] struct dummy *dummies[10]; [L25] int a[10]; [L26] int i, *pa; [L27] i = __VERIFIER_nondet_int() [L28] int j = 0; VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=0] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=1] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=2] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=3] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=4] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=5] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=6] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=7] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=8] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=9] [L28] COND TRUE j < 10 [L29] a[j] = __VERIFIER_nondet_int() [L30] dummies[j] = __VERIFIER_nondet_pointer() [L28] j++ VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L28] COND FALSE !(j < 10) VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10] [L32] COND TRUE i >= 0 && i < 9 [L33] a[i] = i [L34] dummy.array = &a[i] [L35] dummies[i + 1] = &dummy [L36] cont.array = &dummies[0] [L37] EXPR cont.array [L37] EXPR cont.array[i] [L37] EXPR cont.array[i]->array [L37] pa = &cont.array[i]->array[i] [L38] EXPR a[i] VAL [a={102:0}, a[i]=1, cont={72:0}, dummies={56:0}, dummy={101:0}, i=1, j=10, pa={57:0}] [L38] COND TRUE a[i] > 0 [L39] EXPR dummies[i + 1] [L39] EXPR dummies[i + 1]->array [L39] EXPR dummies[i + 1]->array[i] [L39] i = dummies[i + 1]->array[i] - 10 [L40] EXPR \read(*pa) VAL [\read(*pa)=0, a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L40] COND FALSE !(i < *pa) [L43] CALL, EXPR check(&cont, i) VAL [\old(i)=0, pc={72:0}] [L17] EXPR pc->array [L17] EXPR pc->array[i] [L17] EXPR pc->array[i]->array [L17] EXPR pc->array[i]->array[i] [L17] return pc->array[i]->array[i] == i; [L43] RET, EXPR check(&cont, i) VAL [a={102:0}, check(&cont, i)=0, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] [L43] COND TRUE !check(&cont, i) [L51] __VERIFIER_error() VAL [a={102:0}, cont={72:0}, dummies={56:0}, dummy={101:0}, i=0, j=10, pa={57:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 22.4s OverallTime, 12 OverallIterations, 10 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 218 SDtfs, 55 SDslu, 680 SDs, 0 SdLazy, 179 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 9 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 20.4s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 577 NumberOfCodeBlocks, 577 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 519 ConstructedInterpolants, 0 QuantifiedInterpolants, 25833 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1395 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 0/570 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...