./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 45294379b83c6b60e0b0199955cdf7244f057430 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:42:09,835 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:42:09,837 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:42:09,845 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:42:09,845 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:42:09,846 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:42:09,847 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:42:09,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:42:09,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:42:09,850 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:42:09,851 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:42:09,851 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:42:09,852 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:42:09,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:42:09,854 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:42:09,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:42:09,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:42:09,857 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:42:09,858 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:42:09,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:42:09,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:42:09,861 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:42:09,862 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:42:09,863 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:42:09,863 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:42:09,863 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:42:09,865 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:42:09,865 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:42:09,866 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:42:09,867 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:42:09,867 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:42:09,867 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:42:09,867 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:42:09,868 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:42:09,868 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:42:09,869 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:42:09,869 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 07:42:09,879 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:42:09,879 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:42:09,880 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:42:09,880 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:42:09,881 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 07:42:09,881 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 07:42:09,881 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 07:42:09,881 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:42:09,881 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 07:42:09,882 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:42:09,883 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:42:09,883 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:42:09,883 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:42:09,883 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:42:09,883 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:42:09,883 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:42:09,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:42:09,884 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:42:09,884 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:42:09,886 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:42:09,886 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 07:42:09,886 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:42:09,886 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:42:09,886 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_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 -> 45294379b83c6b60e0b0199955cdf7244f057430 [2018-11-23 07:42:09,909 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:42:09,919 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:42:09,922 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:42:09,923 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:42:09,923 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:42:09,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c [2018-11-23 07:42:09,971 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/data/1a1bea4fc/e4024a46803d43f0a369b7918cd95078/FLAG6546656b6 [2018-11-23 07:42:10,293 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:42:10,293 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/sv-benchmarks/c/ldv-regression/test24_false-unreach-call.c [2018-11-23 07:42:10,297 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/data/1a1bea4fc/e4024a46803d43f0a369b7918cd95078/FLAG6546656b6 [2018-11-23 07:42:10,725 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/data/1a1bea4fc/e4024a46803d43f0a369b7918cd95078 [2018-11-23 07:42:10,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:42:10,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:42:10,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:42:10,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:42:10,732 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:42:10,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,734 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548675f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10, skipping insertion in model container [2018-11-23 07:42:10,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,741 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:42:10,754 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:42:10,864 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:42:10,869 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:42:10,880 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:42:10,889 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:42:10,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10 WrapperNode [2018-11-23 07:42:10,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:42:10,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:42:10,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:42:10,890 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:42:10,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,906 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:42:10,906 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:42:10,906 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:42:10,907 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:42:10,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,913 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,914 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,967 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,968 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... [2018-11-23 07:42:10,970 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:42:10,970 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:42:10,970 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:42:10,970 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:42:10,971 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 07:42:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:42:11,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:42:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 07:42:11,022 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:42:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:42:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 07:42:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:42:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:42:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 07:42:11,023 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 07:42:11,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 07:42:11,167 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:42:11,167 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 07:42:11,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:42:11 BoogieIcfgContainer [2018-11-23 07:42:11,168 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:42:11,168 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:42:11,168 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:42:11,171 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:42:11,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:42:10" (1/3) ... [2018-11-23 07:42:11,172 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:42:11, skipping insertion in model container [2018-11-23 07:42:11,172 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:42:10" (2/3) ... [2018-11-23 07:42:11,173 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@818f5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:42:11, skipping insertion in model container [2018-11-23 07:42:11,173 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:42:11" (3/3) ... [2018-11-23 07:42:11,174 INFO L112 eAbstractionObserver]: Analyzing ICFG test24_false-unreach-call.c [2018-11-23 07:42:11,183 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:42:11,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 07:42:11,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 07:42:11,233 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 07:42:11,234 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:42:11,234 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:42:11,234 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:42:11,234 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:42:11,234 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:42:11,234 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:42:11,235 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:42:11,235 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:42:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 07:42:11,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 07:42:11,256 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:11,256 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 07:42:11,258 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:11,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash 855240046, now seen corresponding path program 1 times [2018-11-23 07:42:11,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:11,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:11,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:11,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,375 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 07:42:11,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:42:11,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:42:11,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 07:42:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 07:42:11,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 07:42:11,395 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 07:42:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:11,413 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 07:42:11,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 07:42:11,414 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 07:42:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:11,422 INFO L225 Difference]: With dead ends: 42 [2018-11-23 07:42:11,422 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 07:42:11,425 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 07:42:11,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 07:42:11,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 07:42:11,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 07:42:11,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 07:42:11,449 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 07:42:11,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:11,449 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 07:42:11,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 07:42:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 07:42:11,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 07:42:11,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:11,450 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 07:42:11,451 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:11,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:11,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1631497781, now seen corresponding path program 1 times [2018-11-23 07:42:11,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:11,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:11,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:11,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,501 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 07:42:11,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:42:11,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 07:42:11,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:42:11,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:42:11,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:42:11,503 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-23 07:42:11,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:11,525 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 07:42:11,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:42:11,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 07:42:11,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:11,526 INFO L225 Difference]: With dead ends: 34 [2018-11-23 07:42:11,526 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 07:42:11,527 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 07:42:11,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 07:42:11,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 07:42:11,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 07:42:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 07:42:11,530 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-11-23 07:42:11,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:11,530 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 07:42:11,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:42:11,530 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 07:42:11,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 07:42:11,531 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:11,531 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 07:42:11,531 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:11,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:11,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1934775405, now seen corresponding path program 1 times [2018-11-23 07:42:11,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:11,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:11,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:11,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,575 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 07:42:11,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:11,575 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:11,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:11,634 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 07:42:11,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:11,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 07:42:11,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:42:11,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:42:11,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 07:42:11,652 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-11-23 07:42:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:11,682 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 07:42:11,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:42:11,682 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 07:42:11,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:11,683 INFO L225 Difference]: With dead ends: 36 [2018-11-23 07:42:11,683 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 07:42:11,684 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 07:42:11,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 07:42:11,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-11-23 07:42:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 07:42:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 07:42:11,687 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-23 07:42:11,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:11,687 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 07:42:11,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:42:11,688 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 07:42:11,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:42:11,688 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:11,688 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 07:42:11,688 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:11,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:11,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1739404943, now seen corresponding path program 2 times [2018-11-23 07:42:11,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:11,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:11,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,739 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 07:42:11,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:11,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:11,754 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 07:42:11,782 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 07:42:11,782 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:11,785 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:11,796 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 07:42:11,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:11,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 07:42:11,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:42:11,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:42:11,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:42:11,815 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 6 states. [2018-11-23 07:42:11,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:11,843 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 07:42:11,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:42:11,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 07:42:11,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:11,844 INFO L225 Difference]: With dead ends: 38 [2018-11-23 07:42:11,844 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 07:42:11,845 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 07:42:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 07:42:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-11-23 07:42:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 07:42:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 07:42:11,848 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-11-23 07:42:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:11,848 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 07:42:11,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:42:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 07:42:11,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:42:11,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:11,849 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 07:42:11,850 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:11,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:11,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1328015311, now seen corresponding path program 3 times [2018-11-23 07:42:11,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:11,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,851 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:11,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:11,912 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 07:42:11,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:11,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:11,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:42:11,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 07:42:11,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:11,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:11,969 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 07:42:11,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:11,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 07:42:11,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:42:11,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:42:11,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 07:42:11,988 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-11-23 07:42:12,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:12,015 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 07:42:12,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:42:12,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-11-23 07:42:12,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:12,016 INFO L225 Difference]: With dead ends: 40 [2018-11-23 07:42:12,016 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 07:42:12,017 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 07:42:12,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 07:42:12,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-23 07:42:12,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 07:42:12,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 07:42:12,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-11-23 07:42:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:12,021 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 07:42:12,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:42:12,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 07:42:12,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 07:42:12,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:12,022 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 07:42:12,022 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:12,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:12,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1523652947, now seen corresponding path program 4 times [2018-11-23 07:42:12,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:12,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:12,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,094 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 07:42:12,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:12,094 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:12,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:42:12,138 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:42:12,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:12,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:12,155 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 07:42:12,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:12,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 07:42:12,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:42:12,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:42:12,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:42:12,175 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2018-11-23 07:42:12,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:12,201 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 07:42:12,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:42:12,201 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2018-11-23 07:42:12,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:12,202 INFO L225 Difference]: With dead ends: 42 [2018-11-23 07:42:12,202 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 07:42:12,203 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 07:42:12,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 07:42:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 07:42:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 07:42:12,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 07:42:12,207 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-11-23 07:42:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:12,207 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 07:42:12,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:42:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 07:42:12,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 07:42:12,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:12,209 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 07:42:12,209 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:12,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1787714037, now seen corresponding path program 5 times [2018-11-23 07:42:12,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:12,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:12,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,210 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:12,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,286 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 07:42:12,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:12,287 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:12,302 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 07:42:12,363 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 07:42:12,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:12,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:12,386 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 07:42:12,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:12,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 07:42:12,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 07:42:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:42:12,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 07:42:12,412 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 9 states. [2018-11-23 07:42:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:12,440 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 07:42:12,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:42:12,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-11-23 07:42:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:12,441 INFO L225 Difference]: With dead ends: 44 [2018-11-23 07:42:12,444 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 07:42:12,444 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 07:42:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 07:42:12,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 07:42:12,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 07:42:12,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 07:42:12,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-11-23 07:42:12,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:12,449 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 07:42:12,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 07:42:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 07:42:12,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 07:42:12,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:12,449 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 07:42:12,450 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:12,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 2147351063, now seen corresponding path program 6 times [2018-11-23 07:42:12,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:12,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,522 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 07:42:12,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:12,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:12,530 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 07:42:12,609 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 07:42:12,609 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:12,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:12,622 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 07:42:12,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:12,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 07:42:12,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 07:42:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:42:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:42:12,641 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 10 states. [2018-11-23 07:42:12,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:12,677 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 07:42:12,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:42:12,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-23 07:42:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:12,678 INFO L225 Difference]: With dead ends: 46 [2018-11-23 07:42:12,678 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 07:42:12,678 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 07:42:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 07:42:12,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 07:42:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 07:42:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 07:42:12,682 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 30 [2018-11-23 07:42:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:12,682 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 07:42:12,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 07:42:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 07:42:12,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:42:12,683 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:12,683 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 07:42:12,684 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:12,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -133817927, now seen corresponding path program 7 times [2018-11-23 07:42:12,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:12,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:12,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,779 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 07:42:12,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:12,780 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:12,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:12,841 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 07:42:12,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:12,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 07:42:12,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 07:42:12,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 07:42:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 07:42:12,859 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 11 states. [2018-11-23 07:42:12,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:12,889 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 07:42:12,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:42:12,891 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-23 07:42:12,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:12,892 INFO L225 Difference]: With dead ends: 48 [2018-11-23 07:42:12,892 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 07:42:12,892 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 07:42:12,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 07:42:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-11-23 07:42:12,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 07:42:12,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 07:42:12,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-11-23 07:42:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:12,898 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 07:42:12,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 07:42:12,898 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 07:42:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 07:42:12,898 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:12,899 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 07:42:12,899 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:12,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:12,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1903896357, now seen corresponding path program 8 times [2018-11-23 07:42:12,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:12,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:12,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:12,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:12,993 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 07:42:12,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:12,993 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:13,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 07:42:13,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 07:42:13,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:13,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:13,048 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 07:42:13,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:13,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 07:42:13,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 07:42:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 07:42:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:42:13,064 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 12 states. [2018-11-23 07:42:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:13,094 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 07:42:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 07:42:13,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 34 [2018-11-23 07:42:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:13,095 INFO L225 Difference]: With dead ends: 50 [2018-11-23 07:42:13,095 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 07:42:13,095 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 07:42:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 07:42:13,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-11-23 07:42:13,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 07:42:13,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 07:42:13,098 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-11-23 07:42:13,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:13,098 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 07:42:13,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 07:42:13,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 07:42:13,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 07:42:13,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:13,099 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 07:42:13,099 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:13,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash -2142218371, now seen corresponding path program 9 times [2018-11-23 07:42:13,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:13,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:13,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:13,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:13,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:13,282 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 07:42:13,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:13,282 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/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 07:42:13,290 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:42:13,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 07:42:13,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:13,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:13,518 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 07:42:13,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:13,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 07:42:13,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 07:42:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 07:42:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 07:42:13,535 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 13 states. [2018-11-23 07:42:13,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:13,571 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 07:42:13,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 07:42:13,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2018-11-23 07:42:13,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:13,577 INFO L225 Difference]: With dead ends: 52 [2018-11-23 07:42:13,577 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 07:42:13,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 07:42:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 07:42:13,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 07:42:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 07:42:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 07:42:13,580 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2018-11-23 07:42:13,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:13,580 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 07:42:13,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 07:42:13,580 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 07:42:13,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 07:42:13,581 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:13,581 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 07:42:13,581 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:13,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:13,581 INFO L82 PathProgramCache]: Analyzing trace with hash 758560159, now seen corresponding path program 10 times [2018-11-23 07:42:13,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:13,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:13,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:13,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:13,706 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:13,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:13,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:13,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:42:13,736 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:42:13,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:13,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:13,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:13,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 07:42:13,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:42:13,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:42:13,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:42:13,790 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 14 states. [2018-11-23 07:42:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:13,818 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 07:42:13,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 07:42:13,820 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 38 [2018-11-23 07:42:13,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:13,821 INFO L225 Difference]: With dead ends: 54 [2018-11-23 07:42:13,821 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 07:42:13,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:42:13,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 07:42:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 07:42:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 07:42:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 07:42:13,824 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-11-23 07:42:13,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:13,824 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 07:42:13,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:42:13,825 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 07:42:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 07:42:13,825 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:13,825 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:13,825 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:13,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:13,826 INFO L82 PathProgramCache]: Analyzing trace with hash 972952385, now seen corresponding path program 11 times [2018-11-23 07:42:13,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:13,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:13,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:13,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:13,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:13,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:13,912 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:13,929 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 07:42:14,091 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 07:42:14,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:14,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:14,112 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:14,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:14,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 07:42:14,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 07:42:14,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 07:42:14,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 07:42:14,130 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 15 states. [2018-11-23 07:42:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:14,162 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 07:42:14,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 07:42:14,162 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-11-23 07:42:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:14,163 INFO L225 Difference]: With dead ends: 56 [2018-11-23 07:42:14,163 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 07:42:14,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 07:42:14,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 07:42:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 07:42:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 07:42:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 07:42:14,168 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-11-23 07:42:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:14,168 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 07:42:14,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 07:42:14,169 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 07:42:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 07:42:14,169 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:14,169 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:14,169 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:14,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash 845451363, now seen corresponding path program 12 times [2018-11-23 07:42:14,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:14,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:14,171 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:14,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:14,277 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:14,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:14,278 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 07:42:15,174 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 07:42:15,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:15,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:15,189 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:15,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 07:42:15,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 07:42:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 07:42:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:42:15,208 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 16 states. [2018-11-23 07:42:15,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:15,235 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 07:42:15,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:42:15,235 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2018-11-23 07:42:15,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:15,236 INFO L225 Difference]: With dead ends: 58 [2018-11-23 07:42:15,236 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 07:42:15,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:42:15,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 07:42:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-11-23 07:42:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 07:42:15,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 07:42:15,239 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-11-23 07:42:15,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:15,239 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 07:42:15,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 07:42:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 07:42:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 07:42:15,240 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:15,240 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:15,240 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:15,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:15,240 INFO L82 PathProgramCache]: Analyzing trace with hash -1423946491, now seen corresponding path program 13 times [2018-11-23 07:42:15,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:15,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:15,241 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:15,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:15,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:15,363 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:15,364 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:15,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:15,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:15,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 07:42:15,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 07:42:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 07:42:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 07:42:15,441 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 17 states. [2018-11-23 07:42:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:15,478 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 07:42:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 07:42:15,479 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 44 [2018-11-23 07:42:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:15,479 INFO L225 Difference]: With dead ends: 60 [2018-11-23 07:42:15,479 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 07:42:15,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 07:42:15,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 07:42:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-23 07:42:15,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 07:42:15,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 07:42:15,482 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-11-23 07:42:15,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:15,482 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 07:42:15,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 07:42:15,482 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 07:42:15,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 07:42:15,483 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:15,483 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:15,483 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:15,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:15,483 INFO L82 PathProgramCache]: Analyzing trace with hash -471897817, now seen corresponding path program 14 times [2018-11-23 07:42:15,483 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:15,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:15,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:15,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:15,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:15,604 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:15,604 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:15,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 07:42:15,632 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 07:42:15,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:15,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:15,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 07:42:15,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 07:42:15,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 07:42:15,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 07:42:15,658 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 18 states. [2018-11-23 07:42:15,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:15,694 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 07:42:15,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 07:42:15,694 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-11-23 07:42:15,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:15,695 INFO L225 Difference]: With dead ends: 62 [2018-11-23 07:42:15,695 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 07:42:15,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 07:42:15,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 07:42:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 07:42:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 07:42:15,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 07:42:15,698 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 46 [2018-11-23 07:42:15,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:15,698 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 07:42:15,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 07:42:15,698 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 07:42:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 07:42:15,699 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:15,699 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:15,699 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash -381156151, now seen corresponding path program 15 times [2018-11-23 07:42:15,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:15,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:15,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:15,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:15,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:15,816 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:15,824 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:42:16,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 07:42:16,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:16,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:16,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:16,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 07:42:16,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 07:42:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 07:42:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 07:42:16,974 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 19 states. [2018-11-23 07:42:17,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:17,019 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 07:42:17,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 07:42:17,020 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2018-11-23 07:42:17,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:17,020 INFO L225 Difference]: With dead ends: 64 [2018-11-23 07:42:17,021 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 07:42:17,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 07:42:17,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 07:42:17,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 07:42:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 07:42:17,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 07:42:17,024 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-11-23 07:42:17,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:17,024 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 07:42:17,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 07:42:17,024 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 07:42:17,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 07:42:17,026 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:17,026 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:17,026 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:17,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:17,027 INFO L82 PathProgramCache]: Analyzing trace with hash 922238955, now seen corresponding path program 16 times [2018-11-23 07:42:17,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:17,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:17,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:17,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:17,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:17,142 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:17,148 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:42:17,164 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:42:17,164 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:17,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:17,176 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:17,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:17,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 07:42:17,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 07:42:17,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 07:42:17,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 07:42:17,192 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 20 states. [2018-11-23 07:42:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:17,230 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 07:42:17,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 07:42:17,236 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2018-11-23 07:42:17,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:17,236 INFO L225 Difference]: With dead ends: 66 [2018-11-23 07:42:17,236 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 07:42:17,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 07:42:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 07:42:17,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-11-23 07:42:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 07:42:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 07:42:17,239 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-11-23 07:42:17,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:17,239 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 07:42:17,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 07:42:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 07:42:17,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 07:42:17,239 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:17,239 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:17,239 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:17,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:17,239 INFO L82 PathProgramCache]: Analyzing trace with hash -645514611, now seen corresponding path program 17 times [2018-11-23 07:42:17,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:17,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:17,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:17,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:17,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:17,416 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:17,430 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 07:42:18,789 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 07:42:18,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:18,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:18,811 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:18,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:18,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 07:42:18,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 07:42:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 07:42:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 07:42:18,828 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 21 states. [2018-11-23 07:42:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:18,873 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 07:42:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 07:42:18,874 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 52 [2018-11-23 07:42:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:18,874 INFO L225 Difference]: With dead ends: 68 [2018-11-23 07:42:18,874 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 07:42:18,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 07:42:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 07:42:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-23 07:42:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 07:42:18,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-23 07:42:18,878 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2018-11-23 07:42:18,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:18,878 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-23 07:42:18,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 07:42:18,878 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 07:42:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 07:42:18,878 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:18,879 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:18,879 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:18,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:18,879 INFO L82 PathProgramCache]: Analyzing trace with hash 276829359, now seen corresponding path program 18 times [2018-11-23 07:42:18,879 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:18,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:18,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:18,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:19,073 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:19,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:19,073 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:19,080 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 07:42:24,228 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 07:42:24,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:42:24,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:24,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:24,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 07:42:24,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 07:42:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 07:42:24,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 07:42:24,283 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 22 states. [2018-11-23 07:42:24,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:24,317 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 07:42:24,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 07:42:24,317 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 54 [2018-11-23 07:42:24,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:24,317 INFO L225 Difference]: With dead ends: 70 [2018-11-23 07:42:24,317 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 07:42:24,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 07:42:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 07:42:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-11-23 07:42:24,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 07:42:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 07:42:24,320 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 54 [2018-11-23 07:42:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:24,320 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 07:42:24,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 07:42:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 07:42:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 07:42:24,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:24,321 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:24,321 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:24,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1886121553, now seen corresponding path program 19 times [2018-11-23 07:42:24,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:24,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:24,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:42:24,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:24,498 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:24,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:42:24,498 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:42:24,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:42:24,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:42:24,533 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:42:24,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 07:42:24,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 07:42:24,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 07:42:24,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 07:42:24,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 07:42:24,552 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 23 states. [2018-11-23 07:42:24,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:42:24,587 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 07:42:24,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 07:42:24,588 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 56 [2018-11-23 07:42:24,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:42:24,588 INFO L225 Difference]: With dead ends: 71 [2018-11-23 07:42:24,588 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 07:42:24,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 07:42:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 07:42:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 07:42:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 07:42:24,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 07:42:24,590 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-11-23 07:42:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:42:24,590 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 07:42:24,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 07:42:24,591 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 07:42:24,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 07:42:24,591 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:42:24,591 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:42:24,591 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 07:42:24,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:42:24,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2067273869, now seen corresponding path program 20 times [2018-11-23 07:42:24,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 07:42:24,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 07:42:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:24,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:42:24,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:42:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:42:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:42:24,689 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=163, |#NULL.offset|=161, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] RET #53#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~j~0 < 20); VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~i~0=0, main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~i~0 < #t~mem6);havoc #t~mem6; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10] [?] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] assume true; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] RET #57#return; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !false; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] ----- [2018-11-23 07:42:25,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:42:25 BoogieIcfgContainer [2018-11-23 07:42:25,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:42:25,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:42:25,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:42:25,076 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:42:25,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:42:11" (3/4) ... [2018-11-23 07:42:25,079 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=163, |#NULL.offset|=161, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=163, |old(#NULL.offset)|=161] [?] RET #53#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160);havoc ~ad2~0.base, ~ad2~0.offset;havoc ~i~0;havoc ~j~0;havoc ~pa~0.base, ~pa~0.offset;~j~0 := 0; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=1, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=2, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=3, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=4, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=5, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=6, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=7, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=8, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=9, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=10, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=11, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=12, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=13, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=14, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=15, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=16, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=17, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=18, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !!(~j~0 < 20);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4);havoc #t~nondet3; VAL [main_~j~0=19, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] #t~post1 := ~j~0;~j~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~j~0 < 20); VAL [main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~i~0 := #t~nondet4;havoc #t~nondet4; VAL [main_~i~0=0, main_~j~0=20, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume ~i~0 >= 0 && ~i~0 < 10;~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset;call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4);~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0;call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4);~i~0 := 10 + #t~mem5;havoc #t~mem5; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~mem6|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !(~i~0 < #t~mem6);havoc #t~mem6; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10] [?] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset;~b := #in~b;call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4);#res := (if #t~mem0 == ~b then 1 else 0);havoc #t~mem0; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] assume true; VAL [check_~ad1.base=162, check_~ad1.offset=0, check_~b=10, |#NULL.base|=0, |#NULL.offset|=0, |check_#in~ad1.base|=162, |check_#in~ad1.offset|=0, |check_#in~b|=10, |check_#res|=0] [?] RET #57#return; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret8|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume 0 == #t~ret8;havoc #t~ret8; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] assume !false; VAL [main_~ad2~0.base=162, main_~ad2~0.offset=0, main_~i~0=10, main_~j~0=20, main_~pa~0.base=162, main_~pa~0.offset=0, |#NULL.base|=0, |#NULL.offset|=0, |main_~#ad1~0.base|=162, |main_~#ad1~0.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=163, #NULL.offset=161, old(#NULL.base)=163, old(#NULL.offset)=161] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=163, old(#NULL.offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L15] call ~#ad1~0.base, ~#ad1~0.offset := #Ultimate.alloc(160); [L15] havoc ~ad2~0.base, ~ad2~0.offset; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0.base, ~pa~0.offset; [L17] ~j~0 := 0; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17-L20] assume !!(~j~0 < 20); [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] call write~int(#t~nondet2, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~j~0, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] call write~int(#t~nondet3, ~#ad1~0.base, 4 + (~#ad1~0.offset + 8 * ~j~0), 4); [L19] havoc #t~nondet3; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L17-L20] assume !(~j~0 < 20); VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~i~0=0, ~j~0=20] [L22-L33] assume ~i~0 >= 0 && ~i~0 < 10; [L23] ~ad2~0.base, ~ad2~0.offset := ~#ad1~0.base, ~#ad1~0.offset; [L24] call write~int(~i~0, ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0, 4); [L25] ~pa~0.base, ~pa~0.offset := ~#ad1~0.base, ~#ad1~0.offset + 8 * ~i~0; [L26] call #t~mem5 := read~int(~ad2~0.base, ~ad2~0.offset + 8 * ~i~0, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27] call #t~mem6 := read~int(~pa~0.base, ~pa~0.offset, 4); VAL [#NULL.base=0, #NULL.offset=0, #t~mem6=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L27-L29] assume !(~i~0 < #t~mem6); [L27] havoc #t~mem6; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0] [L8-L11] ~ad1.base, ~ad1.offset := #in~ad1.base, #in~ad1.offset; [L8-L11] ~b := #in~b; [L10] call #t~mem0 := read~int(~ad1.base, ~ad1.offset + 8 * ~b, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L8-L11] ensures true; VAL [#in~ad1.base=162, #in~ad1.offset=0, #in~b=10, #NULL.base=0, #NULL.offset=0, #res=0, ~ad1.base=162, ~ad1.offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0.base, ~#ad1~0.offset, ~i~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL.base=0, #NULL.offset=0, #t~ret8=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L30-L32] assume 0 == #t~ret8; [L30] havoc #t~ret8; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [L37] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~#ad1~0.base=162, ~#ad1~0.offset=0, ~ad2~0.base=162, ~ad2~0.offset=0, ~i~0=10, ~j~0=20, ~pa~0.base=162, ~pa~0.offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=163, #NULL!offset=161, old(#NULL!base)=163, old(#NULL!offset)=161] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=163, old(#NULL!offset)=161] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L15] FCALL call ~#ad1~0 := #Ultimate.alloc(160); [L15] havoc ~ad2~0; [L16] havoc ~i~0; [L16] havoc ~j~0; [L16] havoc ~pa~0; [L17] ~j~0 := 0; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=0] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=1] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=2] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=3] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=4] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=5] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=6] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=7] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=8] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=9] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=10] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=11] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=12] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=13] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=14] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=15] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=16] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=17] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=18] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17-L20] COND FALSE !(!(~j~0 < 20)) [L18] assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647; [L18] FCALL call write~int(#t~nondet2, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~j~0 }, 4); [L18] havoc #t~nondet2; [L19] assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; [L19] FCALL call write~int(#t~nondet3, { base: ~#ad1~0!base, offset: 4 + (~#ad1~0!offset + 8 * ~j~0) }, 4); [L19] havoc #t~nondet3; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=19] [L17] #t~post1 := ~j~0; [L17] ~j~0 := 1 + #t~post1; [L17] havoc #t~post1; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L17-L20] COND TRUE !(~j~0 < 20) VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~j~0=20] [L21] assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; [L21] ~i~0 := #t~nondet4; [L21] havoc #t~nondet4; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~i~0=0, ~j~0=20] [L22] COND TRUE ~i~0 >= 0 && ~i~0 < 10 [L23] ~ad2~0 := ~#ad1~0; [L24] FCALL call write~int(~i~0, { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }, 4); [L25] ~pa~0 := { base: ~#ad1~0!base, offset: ~#ad1~0!offset + 8 * ~i~0 }; [L26] FCALL call #t~mem5 := read~int({ base: ~ad2~0!base, offset: ~ad2~0!offset + 8 * ~i~0 }, 4); [L26] ~i~0 := 10 + #t~mem5; [L26] havoc #t~mem5; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27] FCALL call #t~mem6 := read~int(~pa~0, 4); VAL [#NULL!base=0, #NULL!offset=0, #t~mem6=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L27-L29] COND TRUE !(~i~0 < #t~mem6) [L27] havoc #t~mem6; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] CALL call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0] [L8-L11] ~ad1 := #in~ad1; [L8-L11] ~b := #in~b; [L10] FCALL call #t~mem0 := read~int({ base: ~ad1!base, offset: ~ad1!offset + 8 * ~b }, 4); [L10] #res := (if #t~mem0 == ~b then 1 else 0); [L10] havoc #t~mem0; VAL [#in~ad1!base=162, #in~ad1!offset=0, #in~b=10, #NULL!base=0, #NULL!offset=0, #res=0, ~ad1!base=162, ~ad1!offset=0, ~b=10] [L30] RET call #t~ret8 := check(~#ad1~0, ~i~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] assume -2147483648 <= #t~ret8 && #t~ret8 <= 2147483647; VAL [#NULL!base=0, #NULL!offset=0, #t~ret8=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L30] COND TRUE 0 == #t~ret8 [L30] havoc #t~ret8; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L37] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~#ad1~0!base=162, ~#ad1~0!offset=0, ~ad2~0!base=162, ~ad2~0!offset=0, ~i~0=10, ~j~0=20, ~pa~0!base=162, ~pa~0!offset=0] [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] ----- [2018-11-23 07:42:25,801 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c8dfa4e0-da11-4511-8261-a91d64d41b94/bin-2019/uautomizer/witness.graphml [2018-11-23 07:42:25,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:42:25,802 INFO L168 Benchmark]: Toolchain (without parser) took 15074.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 958.2 MB in the beginning and 1.0 GB in the end (delta: -84.6 MB). Peak memory consumption was 84.8 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:25,804 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:42:25,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.30 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:25,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.51 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:42:25,804 INFO L168 Benchmark]: Boogie Preprocessor took 63.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:25,804 INFO L168 Benchmark]: RCFGBuilder took 197.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:25,805 INFO L168 Benchmark]: TraceAbstraction took 13907.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:25,805 INFO L168 Benchmark]: Witness Printer took 725.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2018-11-23 07:42:25,807 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.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.30 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.51 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -173.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 197.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13907.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 47.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.9 MB). Peak memory consumption was 93.6 MB. Max. memory is 11.5 GB. * Witness Printer took 725.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 37]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] struct dummy ad1[20], *ad2; [L16] int i, j, *pa; [L17] j=0 VAL [ad1={162:0}, j=0] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=1] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=2] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=3] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=4] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=5] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=6] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=7] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=8] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=9] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=10] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=11] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=12] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=13] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=14] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=15] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=16] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=17] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=18] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=19] [L17] COND TRUE j<20 [L18] ad1[j].a = __VERIFIER_nondet_int() [L19] ad1[j].b = __VERIFIER_nondet_int() [L17] j++ VAL [ad1={162:0}, j=20] [L17] COND FALSE !(j<20) VAL [ad1={162:0}, j=20] [L21] i = __VERIFIER_nondet_int() [L22] COND TRUE i >= 0 && i < 10 [L23] ad2 = ad1 [L24] ad1[i].a = i [L25] pa = &ad1[i].a [L26] EXPR ad2[i].a [L26] i = ad2[i].a + 10 [L27] EXPR \read(*pa) VAL [\read(*pa)=0, ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] [L27] COND FALSE !(i < *pa) [L30] CALL, EXPR check(ad1, i) VAL [\old(b)=10, ad1={162:0}] [L10] EXPR ad1[b].a [L10] return ad1[b].a == b; [L30] RET, EXPR check(ad1, i) VAL [ad1={162:0}, ad2={162:0}, check(ad1, i)=0, i=10, j=20, pa={162:0}] [L30] COND TRUE !check(ad1, i) [L37] __VERIFIER_error() VAL [ad1={162:0}, ad2={162:0}, i=10, j=20, pa={162:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. UNSAFE Result, 13.8s OverallTime, 22 OverallIterations, 20 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 407 SDtfs, 210 SDslu, 2720 SDs, 0 SdLazy, 643 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 955 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 19 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 9.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1537 NumberOfCodeBlocks, 1537 NumberOfCodeBlocksAsserted, 143 NumberOfCheckSat, 1439 ConstructedInterpolants, 0 QuantifiedInterpolants, 125333 SizeOfPredicates, 19 NumberOfNonLiveVariables, 3059 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 40 InterpolantComputations, 2 PerfectInterpolantSequences, 0/4940 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...