./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b10c0555613e3e1e99ee574b69e31152fe0aa7f9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:21:51,219 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:21:51,220 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:21:51,227 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:21:51,228 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:21:51,228 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:21:51,229 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:21:51,230 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:21:51,231 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:21:51,231 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:21:51,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:21:51,232 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:21:51,233 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:21:51,233 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:21:51,234 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:21:51,235 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:21:51,235 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:21:51,236 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:21:51,237 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:21:51,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:21:51,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:21:51,240 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:21:51,241 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:21:51,242 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:21:51,242 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:21:51,242 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:21:51,243 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:21:51,243 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:21:51,244 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:21:51,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:21:51,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:21:51,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:21:51,245 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:21:51,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:21:51,246 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:21:51,247 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:21:51,247 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:21:51,257 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:21:51,257 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:21:51,258 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:21:51,258 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:21:51,258 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:21:51,258 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:21:51,258 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:21:51,258 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:21:51,259 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:21:51,259 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:21:51,259 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:21:51,259 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:21:51,259 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:21:51,259 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:21:51,259 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:21:51,260 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:21:51,260 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:21:51,261 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:21:51,261 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:21:51,261 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:21:51,261 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:21:51,262 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:21:51,262 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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(F end) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b10c0555613e3e1e99ee574b69e31152fe0aa7f9 [2018-11-23 15:21:51,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:21:51,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:21:51,297 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:21:51,298 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:21:51,298 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:21:51,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2018-11-23 15:21:51,334 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/data/65cc4021a/51001a8ae5ab4100b27ccd131e35d87c/FLAG13323982e [2018-11-23 15:21:51,736 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:21:51,737 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/sv-benchmarks/c/termination-crafted/NonTermination3_true-no-overflow_false-termination.c [2018-11-23 15:21:51,740 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/data/65cc4021a/51001a8ae5ab4100b27ccd131e35d87c/FLAG13323982e [2018-11-23 15:21:51,750 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/data/65cc4021a/51001a8ae5ab4100b27ccd131e35d87c [2018-11-23 15:21:51,752 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:21:51,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:21:51,753 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:21:51,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:21:51,756 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:21:51,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ef06843 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51, skipping insertion in model container [2018-11-23 15:21:51,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,764 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:21:51,775 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:21:51,881 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:21:51,883 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:21:51,893 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:21:51,906 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:21:51,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51 WrapperNode [2018-11-23 15:21:51,907 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:21:51,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:21:51,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:21:51,907 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:21:51,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,916 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:21:51,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:21:51,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:21:51,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:21:51,932 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,932 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,933 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,933 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... [2018-11-23 15:21:51,977 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:21:51,978 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:21:51,978 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:21:51,978 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:21:51,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:21:52,017 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:21:52,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:21:52,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:21:52,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:21:52,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:21:52,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:21:52,118 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:21:52,118 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 15:21:52,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:21:52 BoogieIcfgContainer [2018-11-23 15:21:52,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:21:52,119 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:21:52,119 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:21:52,122 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:21:52,123 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:21:52,123 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:21:51" (1/3) ... [2018-11-23 15:21:52,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55c06a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:21:52, skipping insertion in model container [2018-11-23 15:21:52,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:21:52,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:21:51" (2/3) ... [2018-11-23 15:21:52,124 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55c06a05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:21:52, skipping insertion in model container [2018-11-23 15:21:52,124 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:21:52,124 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:21:52" (3/3) ... [2018-11-23 15:21:52,126 INFO L375 chiAutomizerObserver]: Analyzing ICFG NonTermination3_true-no-overflow_false-termination.c [2018-11-23 15:21:52,157 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:21:52,158 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:21:52,158 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:21:52,158 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:21:52,158 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:21:52,158 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:21:52,158 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:21:52,158 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:21:52,158 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:21:52,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 15:21:52,185 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:21:52,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:52,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:52,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:21:52,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:21:52,189 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:21:52,189 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 15:21:52,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 15:21:52,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:52,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:52,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:21:52,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 15:21:52,196 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 5#L13-3true [2018-11-23 15:21:52,196 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-3true assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 8#L13-2true main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 5#L13-3true [2018-11-23 15:21:52,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 15:21:52,204 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:52,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:52,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:52,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 15:21:52,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:52,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:52,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:52,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:52,282 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 15:21:52,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:52,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:52,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,427 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:21:52,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:21:52,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:21:52,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:21:52,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:21:52,429 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:21:52,429 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:21:52,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:21:52,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: NonTermination3_true-no-overflow_false-termination.c_Iteration1_Lasso [2018-11-23 15:21:52,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:21:52,429 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:21:52,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:21:52,630 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:21:52,633 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:21:52,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:21:52,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:21:52,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:21:52,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:21:52,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:21:52,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:21:52,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:21:52,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:21:52,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:21:52,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:21:52,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:21:52,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:21:52,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:21:52,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:21:52,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:21:52,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:21:52,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:21:52,658 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:21:52,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:21:52,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:21:52,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 15:21:52,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:21:52,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:21:52,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:21:52,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:21:52,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:21:52,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:21:52,698 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:21:52,709 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:21:52,709 INFO L444 ModelExtractionUtils]: 10 out of 13 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 15:21:52,711 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:21:52,713 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:21:52,713 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:21:52,713 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0) = -2*ULTIMATE.start_main_~n~0 + 19 Supporting invariants [] [2018-11-23 15:21:52,716 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-23 15:21:52,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:52,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:52,772 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:52,781 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 15:21:52,794 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 15:21:52,795 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 3 states. [2018-11-23 15:21:52,826 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 3 states. Result 28 states and 40 transitions. Complement of second has 7 states. [2018-11-23 15:21:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 15:21:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 15:21:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2018-11-23 15:21:52,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 15:21:52,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:21:52,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 15:21:52,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:21:52,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 15:21:52,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:21:52,830 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2018-11-23 15:21:52,832 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:52,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 9 states and 12 transitions. [2018-11-23 15:21:52,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:52,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 15:21:52,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 12 transitions. [2018-11-23 15:21:52,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:52,836 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 12 transitions. [2018-11-23 15:21:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 12 transitions. [2018-11-23 15:21:52,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-23 15:21:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 15:21:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2018-11-23 15:21:52,860 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-23 15:21:52,860 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2018-11-23 15:21:52,860 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:21:52,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2018-11-23 15:21:52,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:52,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:52,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:52,861 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 15:21:52,861 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:52,861 INFO L794 eck$LassoCheckResult]: Stem: 88#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 84#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 85#L13-3 assume !(main_~n~0 < 10); 83#L17-4 [2018-11-23 15:21:52,862 INFO L796 eck$LassoCheckResult]: Loop: 83#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 89#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 82#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 83#L17-4 [2018-11-23 15:21:52,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash 29861, now seen corresponding path program 1 times [2018-11-23 15:21:52,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:52,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:52,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:52,886 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 15:21:52,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:21:52,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:21:52,889 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:52,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:52,889 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 1 times [2018-11-23 15:21:52,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:52,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:52,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:52,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 15:21:53,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 15:21:53,015 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-23 15:21:53,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:53,022 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2018-11-23 15:21:53,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 15:21:53,023 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 11 transitions. [2018-11-23 15:21:53,023 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 11 transitions. [2018-11-23 15:21:53,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:53,024 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:53,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-23 15:21:53,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:53,024 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-23 15:21:53,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-23 15:21:53,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-11-23 15:21:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 15:21:53,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-11-23 15:21:53,025 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 15:21:53,026 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-11-23 15:21:53,026 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:21:53,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2018-11-23 15:21:53,026 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,026 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:53,026 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:53,026 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 15:21:53,027 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:53,027 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 105#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 106#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 109#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 110#L13-3 assume !(main_~n~0 < 10); 108#L17-4 [2018-11-23 15:21:53,027 INFO L796 eck$LassoCheckResult]: Loop: 108#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 112#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 107#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 108#L17-4 [2018-11-23 15:21:53,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 28698723, now seen corresponding path program 1 times [2018-11-23 15:21:53,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,051 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 15:21:53,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:53,052 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:53,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:53,078 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 15:21:53,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-23 15:21:53,092 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:53,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,092 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 2 times [2018-11-23 15:21:53,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:53,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 15:21:53,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 15:21:53,165 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-23 15:21:53,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:53,181 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2018-11-23 15:21:53,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 15:21:53,182 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 13 transitions. [2018-11-23 15:21:53,182 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,183 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 13 transitions. [2018-11-23 15:21:53,183 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:53,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:53,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 13 transitions. [2018-11-23 15:21:53,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:53,183 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-23 15:21:53,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 13 transitions. [2018-11-23 15:21:53,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-11-23 15:21:53,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 15:21:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-23 15:21:53,185 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 15:21:53,185 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-23 15:21:53,185 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:21:53,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-23 15:21:53,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:53,186 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:53,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1] [2018-11-23 15:21:53,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:53,186 INFO L794 eck$LassoCheckResult]: Stem: 151#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 145#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 148#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 149#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 150#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 153#L13-3 assume !(main_~n~0 < 10); 147#L17-4 [2018-11-23 15:21:53,188 INFO L796 eck$LassoCheckResult]: Loop: 147#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 152#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 146#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 147#L17-4 [2018-11-23 15:21:53,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1809671329, now seen corresponding path program 2 times [2018-11-23 15:21:53,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,213 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 15:21:53,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:53,213 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:53,219 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:21:53,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:21:53,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:53,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:53,248 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 15:21:53,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:53,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 15:21:53,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:53,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,263 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 3 times [2018-11-23 15:21:53,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:21:53,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:21:53,339 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-23 15:21:53,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:53,355 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2018-11-23 15:21:53,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 15:21:53,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2018-11-23 15:21:53,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,356 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 15 transitions. [2018-11-23 15:21:53,357 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:53,357 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:53,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 15 transitions. [2018-11-23 15:21:53,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:53,357 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-23 15:21:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 15 transitions. [2018-11-23 15:21:53,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-23 15:21:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 15:21:53,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-23 15:21:53,359 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-23 15:21:53,359 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-23 15:21:53,359 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:21:53,359 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-23 15:21:53,359 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,359 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:53,359 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:53,360 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1] [2018-11-23 15:21:53,360 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:53,360 INFO L794 eck$LassoCheckResult]: Stem: 201#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 196#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 197#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 198#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 199#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 200#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 205#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 204#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 203#L13-3 assume !(main_~n~0 < 10); 195#L17-4 [2018-11-23 15:21:53,360 INFO L796 eck$LassoCheckResult]: Loop: 195#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 202#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 194#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 195#L17-4 [2018-11-23 15:21:53,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,360 INFO L82 PathProgramCache]: Analyzing trace with hash -367605409, now seen corresponding path program 3 times [2018-11-23 15:21:53,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,390 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 15:21:53,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:53,390 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:53,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:21:53,409 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 15:21:53,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:53,410 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:53,415 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 15:21:53,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:53,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 15:21:53,430 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:53,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,430 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 4 times [2018-11-23 15:21:53,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,431 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:21:53,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:21:53,508 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. cyclomatic complexity: 4 Second operand 7 states. [2018-11-23 15:21:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:53,520 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-23 15:21:53,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 15:21:53,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-23 15:21:53,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-23 15:21:53,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:53,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:53,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-23 15:21:53,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:53,522 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-23 15:21:53,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-23 15:21:53,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-23 15:21:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 15:21:53,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-11-23 15:21:53,524 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 15:21:53,524 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-23 15:21:53,524 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:21:53,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 16 transitions. [2018-11-23 15:21:53,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:53,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:53,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 1, 1, 1] [2018-11-23 15:21:53,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:53,525 INFO L794 eck$LassoCheckResult]: Stem: 262#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 255#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 256#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 259#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 260#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 261#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 263#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 268#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 267#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 266#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 265#L13-3 assume !(main_~n~0 < 10); 258#L17-4 [2018-11-23 15:21:53,525 INFO L796 eck$LassoCheckResult]: Loop: 258#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 264#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 257#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 258#L17-4 [2018-11-23 15:21:53,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1081477475, now seen corresponding path program 4 times [2018-11-23 15:21:53,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,553 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 15:21:53,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:53,553 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:53,572 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 15:21:53,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 15:21:53,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:53,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:53,588 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 15:21:53,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:53,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 15:21:53,603 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:53,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,604 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 5 times [2018-11-23 15:21:53,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:21:53,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:21:53,685 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. cyclomatic complexity: 4 Second operand 8 states. [2018-11-23 15:21:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:53,700 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-11-23 15:21:53,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:21:53,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-23 15:21:53,702 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 19 transitions. [2018-11-23 15:21:53,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:53,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:53,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-23 15:21:53,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:53,703 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-23 15:21:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-23 15:21:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-23 15:21:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 15:21:53,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-11-23 15:21:53,704 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 15:21:53,704 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-11-23 15:21:53,704 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 15:21:53,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 18 transitions. [2018-11-23 15:21:53,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:53,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:53,706 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 1, 1, 1] [2018-11-23 15:21:53,706 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:53,706 INFO L794 eck$LassoCheckResult]: Stem: 334#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 330#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 331#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 332#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 333#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 335#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 342#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 341#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 340#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 339#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 338#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 337#L13-3 assume !(main_~n~0 < 10); 328#L17-4 [2018-11-23 15:21:53,706 INFO L796 eck$LassoCheckResult]: Loop: 328#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 336#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 327#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 328#L17-4 [2018-11-23 15:21:53,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash 82234459, now seen corresponding path program 5 times [2018-11-23 15:21:53,706 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,738 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 15:21:53,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:53,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:53,744 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 15:21:53,754 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 15:21:53,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:53,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:53,762 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 15:21:53,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:53,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 15:21:53,777 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:53,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,777 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 6 times [2018-11-23 15:21:53,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,778 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 15:21:53,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:21:53,850 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. cyclomatic complexity: 4 Second operand 9 states. [2018-11-23 15:21:53,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:53,866 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-23 15:21:53,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:21:53,867 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-23 15:21:53,867 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 19 states and 21 transitions. [2018-11-23 15:21:53,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:53,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:53,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 21 transitions. [2018-11-23 15:21:53,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:53,868 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-11-23 15:21:53,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 21 transitions. [2018-11-23 15:21:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-11-23 15:21:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 15:21:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 15:21:53,870 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 15:21:53,870 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 15:21:53,870 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 15:21:53,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 20 transitions. [2018-11-23 15:21:53,871 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:53,871 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:53,871 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:53,872 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 1, 1, 1] [2018-11-23 15:21:53,872 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:53,872 INFO L794 eck$LassoCheckResult]: Stem: 417#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 410#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 411#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 414#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 415#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 416#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 418#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 427#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 426#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 425#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 424#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 423#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 422#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 421#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 420#L13-3 assume !(main_~n~0 < 10); 413#L17-4 [2018-11-23 15:21:53,872 INFO L796 eck$LassoCheckResult]: Loop: 413#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 419#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 412#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 413#L17-4 [2018-11-23 15:21:53,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1717906073, now seen corresponding path program 6 times [2018-11-23 15:21:53,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:53,912 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 15:21:53,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:53,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:53,919 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 15:21:53,931 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 15:21:53,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:53,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:53,939 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 15:21:53,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:53,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 15:21:53,954 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:53,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:53,955 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 7 times [2018-11-23 15:21:53,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:53,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:53,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:53,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:53,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 15:21:54,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 15:21:54,035 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. cyclomatic complexity: 4 Second operand 10 states. [2018-11-23 15:21:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:54,051 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-11-23 15:21:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:21:54,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 23 transitions. [2018-11-23 15:21:54,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,052 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 15:21:54,052 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:54,052 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:54,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 23 transitions. [2018-11-23 15:21:54,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:54,052 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 15:21:54,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 23 transitions. [2018-11-23 15:21:54,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 15:21:54,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 15:21:54,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 15:21:54,054 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 15:21:54,054 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 15:21:54,054 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-23 15:21:54,054 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 22 transitions. [2018-11-23 15:21:54,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,055 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:54,055 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:54,055 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 1, 1, 1] [2018-11-23 15:21:54,055 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:54,055 INFO L794 eck$LassoCheckResult]: Stem: 511#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 504#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 505#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 508#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 509#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 510#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 512#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 523#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 522#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 521#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 520#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 519#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 518#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 517#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 516#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 515#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 514#L13-3 assume !(main_~n~0 < 10); 507#L17-4 [2018-11-23 15:21:54,055 INFO L796 eck$LassoCheckResult]: Loop: 507#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 513#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 506#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 507#L17-4 [2018-11-23 15:21:54,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1640296791, now seen corresponding path program 7 times [2018-11-23 15:21:54,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:54,129 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 15:21:54,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:54,129 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:54,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:54,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:54,160 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 15:21:54,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:54,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 15:21:54,185 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:54,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,185 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 8 times [2018-11-23 15:21:54,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:21:54,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 15:21:54,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:21:54,261 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. cyclomatic complexity: 4 Second operand 11 states. [2018-11-23 15:21:54,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:54,287 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 15:21:54,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 15:21:54,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 25 transitions. [2018-11-23 15:21:54,288 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,289 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 15:21:54,289 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:54,289 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:54,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 25 transitions. [2018-11-23 15:21:54,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:54,289 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 15:21:54,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 25 transitions. [2018-11-23 15:21:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-11-23 15:21:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 15:21:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 15:21:54,291 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 15:21:54,291 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 15:21:54,291 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-23 15:21:54,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2018-11-23 15:21:54,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:54,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:54,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 1, 1, 1] [2018-11-23 15:21:54,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:54,293 INFO L794 eck$LassoCheckResult]: Stem: 616#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 611#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 612#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 613#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 614#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 615#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 617#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 630#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 629#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 628#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 627#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 626#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 625#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 624#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 623#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 622#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 621#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 620#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 619#L13-3 assume !(main_~n~0 < 10); 610#L17-4 [2018-11-23 15:21:54,293 INFO L796 eck$LassoCheckResult]: Loop: 610#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 618#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 609#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 610#L17-4 [2018-11-23 15:21:54,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,293 INFO L82 PathProgramCache]: Analyzing trace with hash 72220821, now seen corresponding path program 8 times [2018-11-23 15:21:54,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:54,376 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 15:21:54,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:54,376 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:54,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 15:21:54,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 15:21:54,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:54,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:54,411 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 15:21:54,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:54,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 15:21:54,437 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:54,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,437 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 9 times [2018-11-23 15:21:54,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 15:21:54,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:21:54,514 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand 12 states. [2018-11-23 15:21:54,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:54,530 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 15:21:54,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:21:54,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 27 transitions. [2018-11-23 15:21:54,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 27 transitions. [2018-11-23 15:21:54,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:54,532 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:54,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-23 15:21:54,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:54,532 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-23 15:21:54,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-23 15:21:54,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 15:21:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 15:21:54,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 15:21:54,533 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 15:21:54,533 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 15:21:54,533 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-23 15:21:54,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 26 transitions. [2018-11-23 15:21:54,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:54,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:54,534 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [9, 9, 1, 1, 1] [2018-11-23 15:21:54,534 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:54,535 INFO L794 eck$LassoCheckResult]: Stem: 732#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 727#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 728#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 729#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 730#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 731#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 733#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 748#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 747#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 746#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 745#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 744#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 743#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 742#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 741#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 740#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 739#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 738#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 737#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 736#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 735#L13-3 assume !(main_~n~0 < 10); 726#L17-4 [2018-11-23 15:21:54,535 INFO L796 eck$LassoCheckResult]: Loop: 726#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 734#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 725#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 726#L17-4 [2018-11-23 15:21:54,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,535 INFO L82 PathProgramCache]: Analyzing trace with hash 684734547, now seen corresponding path program 9 times [2018-11-23 15:21:54,535 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,535 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:21:54,613 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 15:21:54,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:21:54,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/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 15:21:54,624 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 15:21:54,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 15:21:54,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 15:21:54,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:21:54,660 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 15:21:54,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:21:54,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 15:21:54,676 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:21:54,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,676 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 10 times [2018-11-23 15:21:54,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:21:54,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:21:54,778 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. cyclomatic complexity: 4 Second operand 13 states. [2018-11-23 15:21:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:21:54,824 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 15:21:54,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:21:54,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 28 transitions. [2018-11-23 15:21:54,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 15:21:54,826 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2018-11-23 15:21:54,826 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2018-11-23 15:21:54,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 28 transitions. [2018-11-23 15:21:54,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:21:54,826 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 15:21:54,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 28 transitions. [2018-11-23 15:21:54,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 15:21:54,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 15:21:54,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-11-23 15:21:54,827 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 15:21:54,827 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-11-23 15:21:54,827 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-23 15:21:54,827 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 28 transitions. [2018-11-23 15:21:54,828 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:21:54,828 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:21:54,828 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:21:54,828 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [10, 10, 1, 1, 1] [2018-11-23 15:21:54,828 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:21:54,828 INFO L794 eck$LassoCheckResult]: Stem: 858#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 853#L-1 havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; 854#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 855#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 856#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 857#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 859#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 876#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 875#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 874#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 873#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 872#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 871#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 870#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 869#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 868#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 867#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 866#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 865#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 864#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 863#L13-3 assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; 862#L13-2 main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; 861#L13-3 assume !(main_~n~0 < 10); 852#L17-4 [2018-11-23 15:21:54,828 INFO L796 eck$LassoCheckResult]: Loop: 852#L17-4 main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; 860#L17 assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; 851#L17-2 assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; 852#L17-4 [2018-11-23 15:21:54,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,829 INFO L82 PathProgramCache]: Analyzing trace with hash 899905681, now seen corresponding path program 10 times [2018-11-23 15:21:54,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash 48762, now seen corresponding path program 11 times [2018-11-23 15:21:54,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:21:54,858 INFO L82 PathProgramCache]: Analyzing trace with hash -95699990, now seen corresponding path program 1 times [2018-11-23 15:21:54,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:21:54,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:21:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:21:54,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:21:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:21:57,252 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 186 DAG size of output: 142 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !(main_~n~0 < 10); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [?] assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; [?] assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() ----- [2018-11-23 15:21:57,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:21:57 BoogieIcfgContainer [2018-11-23 15:21:57,374 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:21:57,375 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:21:57,375 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:21:57,375 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:21:57,375 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:21:52" (3/4) ... [2018-11-23 15:21:57,378 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !(main_~n~0 < 10); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [?] assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; [?] assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() ----- [2018-11-23 15:21:57,454 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_84116525-7d2e-4d86-8a76-b4eaa1d9f2bc/bin-2019/uautomizer/witness.graphml [2018-11-23 15:21:57,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:21:57,455 INFO L168 Benchmark]: Toolchain (without parser) took 5702.71 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 232.8 MB). Free memory was 959.1 MB in the beginning and 965.9 MB in the end (delta: -6.8 MB). Peak memory consumption was 226.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,456 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:21:57,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 153.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.52 ms. Allocated memory is still 1.0 GB. Free memory was 948.1 MB in the beginning and 945.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,457 INFO L168 Benchmark]: Boogie Preprocessor took 50.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 945.4 MB in the beginning and 1.2 GB in the end (delta: -223.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,457 INFO L168 Benchmark]: RCFGBuilder took 141.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,458 INFO L168 Benchmark]: BuchiAutomizer took 5255.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.4 MB). Free memory was 1.2 GB in the beginning and 970.6 MB in the end (delta: 180.7 MB). Peak memory consumption was 243.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,458 INFO L168 Benchmark]: Witness Printer took 79.60 ms. Allocated memory is still 1.3 GB. Free memory was 970.6 MB in the beginning and 965.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:21:57,461 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 153.69 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.1 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.52 ms. Allocated memory is still 1.0 GB. Free memory was 948.1 MB in the beginning and 945.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 170.4 MB). Free memory was 945.4 MB in the beginning and 1.2 GB in the end (delta: -223.3 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 141.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5255.18 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 62.4 MB). Free memory was 1.2 GB in the beginning and 970.6 MB in the end (delta: 180.7 MB). Peak memory consumption was 243.1 MB. Max. memory is 11.5 GB. * Witness Printer took 79.60 ms. Allocated memory is still 1.3 GB. Free memory was 970.6 MB in the beginning and 965.9 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (10 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * n + 19 and consists of 5 locations. 10 modules have a trivial ranking function, the largest among these consists of 13 locations. The remainder module has 26 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 12 iterations. TraceHistogramMax:10. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 11. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 80 SDtfs, 65 SDslu, 251 SDs, 0 SdLazy, 188 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU10 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp93 ukn58 mio100 lsp72 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@640a9352=0, NULL=0, \result=0, n=10, i=6, a=3, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3b09df69=6, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3a57bba3=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4a922189=0, a=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@282bc5a0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@54381b12=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !(main_~n~0 < 10); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [?] assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; [?] assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;main_~i~0 := main_#t~nondet0;havoc main_#t~nondet0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40);main_~n~0 := 0; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !!(main_~n~0 < 10);call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4);havoc main_#t~nondet2; [?] main_#t~pre1 := 1 + main_~n~0;main_~n~0 := 1 + main_~n~0;havoc main_#t~pre1; [?] assume !(main_~n~0 < 10); [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0.base, main_~#a~0.offset; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] call main_~#a~0.base, main_~#a~0.offset := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !!(main_~n~0 < 10); [L14] call write~int(main_#t~nondet2, main_~#a~0.base, main_~#a~0.offset + 4 * main_~n~0, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] assume !(main_~n~0 < 10); [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~nondet2, main_#t~pre1, main_~n~0, main_#t~nondet5, main_#t~mem3, main_#t~short4, main_~i~0, main_~#a~0; [L10] main_~i~0 := main_#t~nondet0; [L10] havoc main_#t~nondet0; [L11] FCALL call main_~#a~0 := #Ultimate.alloc(40); [L13] main_~n~0 := 0; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND FALSE !(!(main_~n~0 < 10)) [L14] FCALL call write~int(main_#t~nondet2, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~n~0 }, 4); [L14] havoc main_#t~nondet2; [L13] main_#t~pre1 := 1 + main_~n~0; [L13] main_~n~0 := 1 + main_~n~0; [L13] havoc main_#t~pre1; [L13-L15] COND TRUE !(main_~n~0 < 10) [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L10] ~i~0 := #t~nondet0; [L10] havoc #t~nondet0; [L11] FCALL call ~#a~0 := #Ultimate.alloc(40); [L13] ~n~0 := 0; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND FALSE !(!(~n~0 < 10)) [L14] FCALL call write~int(#t~nondet2, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~n~0 }, 4); [L14] havoc #t~nondet2; [L13] #t~pre1 := 1 + ~n~0; [L13] ~n~0 := 1 + ~n~0; [L13] havoc #t~pre1; [L13-L15] COND TRUE !(~n~0 < 10) [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [?] assume main_#t~short4;call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_#t~short4 := main_#t~mem3 >= 0; [?] assume !!main_#t~short4;havoc main_#t~short4;havoc main_#t~mem3;call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);main_~i~0 := main_#t~nondet5;havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] assume main_#t~short4; [L17] call main_#t~mem3 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] assume !!main_#t~short4; [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] call write~int(0, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L17] main_#t~short4 := 0 <= main_~i~0 && main_~i~0 < 10; [L17] COND TRUE main_#t~short4 [L17] FCALL call main_#t~mem3 := read~int({ base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L17] main_#t~short4 := main_#t~mem3 >= 0; [L17-L20] COND FALSE !(!main_#t~short4) [L17] havoc main_#t~short4; [L17] havoc main_#t~mem3; [L18] FCALL call write~int(0, { base: main_~#a~0!base, offset: main_~#a~0!offset + 4 * main_~i~0 }, 4); [L19] main_~i~0 := main_#t~nondet5; [L19] havoc main_#t~nondet5; [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L17] #t~short4 := 0 <= ~i~0 && ~i~0 < 10; [L17] COND TRUE #t~short4 [L17] FCALL call #t~mem3 := read~int({ base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L17] #t~short4 := #t~mem3 >= 0; [L17-L20] COND FALSE !(!#t~short4) [L17] havoc #t~short4; [L17] havoc #t~mem3; [L18] FCALL call write~int(0, { base: ~#a~0!base, offset: ~#a~0!offset + 4 * ~i~0 }, 4); [L19] ~i~0 := #t~nondet5; [L19] havoc #t~nondet5; [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int i = __VERIFIER_nondet_int(); [L11] int a[10]; [L13] int n = 0; [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND TRUE n < 10 [L14] a[n] = __VERIFIER_nondet_int() [L13] ++n [L13] COND FALSE !(n < 10) Loop: [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] EXPR a[i] [L17] 0 <= i && i < 10 && a[i] >= 0 [L17] COND TRUE 0 <= i && i < 10 && a[i] >= 0 [L18] a[i] = 0 [L19] i = __VERIFIER_nondet_int() End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...