./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/n.c11_true-unreach-call_false-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/n.c11_true-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/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 32bit --witnessprinter.graph.data.programhash 24b22c477e8a47eac290a2fc1c5b1e1aaa3a4fa4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:56:50,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:56:50,172 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:56:50,179 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:56:50,179 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:56:50,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:56:50,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:56:50,182 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:56:50,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:56:50,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:56:50,184 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:56:50,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:56:50,185 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:56:50,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:56:50,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:56:50,188 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:56:50,189 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:56:50,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:56:50,192 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:56:50,193 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:56:50,194 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:56:50,195 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:56:50,197 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:56:50,197 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:56:50,197 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:56:50,198 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:56:50,199 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:56:50,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:56:50,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:56:50,201 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:56:50,201 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:56:50,202 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:56:50,202 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:56:50,202 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:56:50,203 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:56:50,204 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:56:50,204 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 13:56:50,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:56:50,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:56:50,215 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:56:50,215 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:56:50,216 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:56:50,216 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 13:56:50,216 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 13:56:50,216 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 13:56:50,216 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 13:56:50,216 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 13:56:50,216 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 13:56:50,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 13:56:50,217 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 13:56:50,218 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:56:50,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:56:50,218 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 13:56:50,219 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:56:50,219 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 13:56:50,219 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:56:50,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:56:50,220 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 13:56:50,220 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:56:50,220 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:56:50,220 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 13:56:50,221 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 13:56:50,221 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_663b2c4a-28a7-4384-9b95-9f7b351f264d/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24b22c477e8a47eac290a2fc1c5b1e1aaa3a4fa4 [2018-11-23 13:56:50,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:56:50,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:56:50,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:56:50,257 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:56:50,257 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:56:50,258 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/../../sv-benchmarks/c/loops/n.c11_true-unreach-call_false-termination.i [2018-11-23 13:56:50,297 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/data/58dd14a02/928b212763174fe281c51a0c25619b75/FLAG66d6a4c70 [2018-11-23 13:56:50,630 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:56:50,631 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/sv-benchmarks/c/loops/n.c11_true-unreach-call_false-termination.i [2018-11-23 13:56:50,635 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/data/58dd14a02/928b212763174fe281c51a0c25619b75/FLAG66d6a4c70 [2018-11-23 13:56:51,057 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/data/58dd14a02/928b212763174fe281c51a0c25619b75 [2018-11-23 13:56:51,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:56:51,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:56:51,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:56:51,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:56:51,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:56:51,064 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,066 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e42f8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51, skipping insertion in model container [2018-11-23 13:56:51,066 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,072 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:56:51,086 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:56:51,199 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:56:51,202 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:56:51,212 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:56:51,221 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:56:51,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51 WrapperNode [2018-11-23 13:56:51,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:56:51,222 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:56:51,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:56:51,222 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:56:51,228 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:56:51,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:56:51,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:56:51,242 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:56:51,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,254 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,255 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... [2018-11-23 13:56:51,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:56:51,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:56:51,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:56:51,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:56:51,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/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 13:56:51,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:56:51,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:56:51,421 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:56:51,421 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 13:56:51,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:51 BoogieIcfgContainer [2018-11-23 13:56:51,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:56:51,422 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 13:56:51,422 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 13:56:51,424 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 13:56:51,425 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:56:51,425 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 01:56:51" (1/3) ... [2018-11-23 13:56:51,426 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14778e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:56:51, skipping insertion in model container [2018-11-23 13:56:51,426 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:56:51,426 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:56:51" (2/3) ... [2018-11-23 13:56:51,426 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@14778e9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 01:56:51, skipping insertion in model container [2018-11-23 13:56:51,426 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 13:56:51,427 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:51" (3/3) ... [2018-11-23 13:56:51,428 INFO L375 chiAutomizerObserver]: Analyzing ICFG n.c11_true-unreach-call_false-termination.i [2018-11-23 13:56:51,464 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:56:51,465 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 13:56:51,465 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 13:56:51,465 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 13:56:51,465 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:56:51,465 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:56:51,465 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 13:56:51,465 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:56:51,465 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 13:56:51,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 13:56:51,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:56:51,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:56:51,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:56:51,494 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 13:56:51,495 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:56:51,495 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 13:56:51,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-23 13:56:51,496 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:56:51,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:56:51,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:56:51,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-23 13:56:51,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:56:51,504 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 5#L13-2true [2018-11-23 13:56:51,505 INFO L796 eck$LassoCheckResult]: Loop: 5#L13-2true assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 11#L14true assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 7#L14-2true assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 5#L13-2true [2018-11-23 13:56:51,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:51,510 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-23 13:56:51,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:51,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:51,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:51,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:51,578 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2018-11-23 13:56:51,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:51,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:51,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:51,602 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2018-11-23 13:56:51,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:51,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:51,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:56:51,677 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 13:56:51,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:56:51,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:56:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:56:51,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:56:51,737 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-11-23 13:56:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:56:51,767 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 13:56:51,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:56:51,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-23 13:56:51,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-23 13:56:51,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2018-11-23 13:56:51,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-23 13:56:51,776 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-23 13:56:51,776 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-23 13:56:51,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:56:51,777 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-23 13:56:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-23 13:56:51,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-11-23 13:56:51,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:56:51,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-23 13:56:51,794 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-23 13:56:51,794 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-23 13:56:51,794 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 13:56:51,794 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-11-23 13:56:51,795 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 13:56:51,795 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:56:51,795 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:56:51,795 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:56:51,795 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 13:56:51,795 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 44#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 48#L14 assume !(4 == main_~len~0 % 4294967296); 47#L14-2 [2018-11-23 13:56:51,796 INFO L796 eck$LassoCheckResult]: Loop: 47#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 45#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 46#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 47#L14-2 [2018-11-23 13:56:51,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:51,796 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-23 13:56:51,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:51,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:51,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:51,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:51,803 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2018-11-23 13:56:51,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:51,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:51,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:51,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2018-11-23 13:56:51,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:51,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:51,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:51,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:56:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:56:51,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:56:51,891 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/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 13:56:51,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:56:51,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:56:51,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:56:51,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:56:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 3 [2018-11-23 13:56:52,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:56:52,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:56:52,026 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-23 13:56:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:56:52,042 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-11-23 13:56:52,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:56:52,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2018-11-23 13:56:52,047 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-23 13:56:52,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2018-11-23 13:56:52,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-23 13:56:52,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-23 13:56:52,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2018-11-23 13:56:52,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:56:52,048 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-23 13:56:52,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2018-11-23 13:56:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-11-23 13:56:52,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 13:56:52,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-23 13:56:52,050 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 13:56:52,050 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-23 13:56:52,050 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 13:56:52,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-23 13:56:52,050 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-23 13:56:52,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:56:52,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:56:52,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:56:52,051 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-23 13:56:52,051 INFO L794 eck$LassoCheckResult]: Stem: 84#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 85#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 92#L14 assume !(4 == main_~len~0 % 4294967296); 88#L14-2 [2018-11-23 13:56:52,051 INFO L796 eck$LassoCheckResult]: Loop: 88#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 86#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 87#L14 assume !(4 == main_~len~0 % 4294967296); 89#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 91#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 90#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 88#L14-2 [2018-11-23 13:56:52,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:52,052 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2018-11-23 13:56:52,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:52,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:52,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:52,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:52,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2018-11-23 13:56:52,058 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:52,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,059 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:52,082 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2018-11-23 13:56:52,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:52,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:56:52,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:56:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:56:52,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:56:52,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/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 13:56:52,157 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:56:52,178 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:56:52,178 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:56:52,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:56:52,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:56:52,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:56:52,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 4 [2018-11-23 13:56:52,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:56:52,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:56:52,416 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-23 13:56:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:56:52,436 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:56:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:56:52,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-23 13:56:52,437 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-23 13:56:52,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:56:52,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-23 13:56:52,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-23 13:56:52,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-23 13:56:52,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:56:52,439 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:56:52,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-23 13:56:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-23 13:56:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:56:52,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-23 13:56:52,440 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:56:52,440 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-23 13:56:52,440 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 13:56:52,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-23 13:56:52,441 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-23 13:56:52,441 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:56:52,441 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:56:52,441 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:56:52,442 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-23 13:56:52,442 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 142#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 152#L14 assume !(4 == main_~len~0 % 4294967296); 145#L14-2 [2018-11-23 13:56:52,442 INFO L796 eck$LassoCheckResult]: Loop: 145#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 144#L14 assume !(4 == main_~len~0 % 4294967296); 150#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 151#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 146#L14 assume !(4 == main_~len~0 % 4294967296); 147#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 148#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 145#L14-2 [2018-11-23 13:56:52,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-23 13:56:52,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:52,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2018-11-23 13:56:52,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:52,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:52,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:52,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:52,475 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2018-11-23 13:56:52,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:52,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:52,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,476 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:52,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:52,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:56:52,550 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:56:52,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:56:52,550 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/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 13:56:52,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 13:56:52,575 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 13:56:52,575 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:56:52,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:56:52,592 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:56:52,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:56:52,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 13:56:52,978 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-11-23 13:56:53,235 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 29 [2018-11-23 13:56:53,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:56:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:56:53,236 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 7 states. [2018-11-23 13:56:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:56:53,266 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:56:53,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:56:53,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-23 13:56:53,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-23 13:56:53,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2018-11-23 13:56:53,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 13:56:53,268 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 13:56:53,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2018-11-23 13:56:53,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 13:56:53,268 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-23 13:56:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2018-11-23 13:56:53,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:56:53,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:56:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:56:53,270 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:56:53,270 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:56:53,270 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 13:56:53,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:56:53,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-23 13:56:53,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 13:56:53,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 13:56:53,271 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-23 13:56:53,271 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-23 13:56:53,271 INFO L794 eck$LassoCheckResult]: Stem: 214#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; 215#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 216#L14 assume !(4 == main_~len~0 % 4294967296); 217#L14-2 [2018-11-23 13:56:53,272 INFO L796 eck$LassoCheckResult]: Loop: 217#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 228#L14 assume !(4 == main_~len~0 % 4294967296); 227#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 226#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 225#L14 assume !(4 == main_~len~0 % 4294967296); 224#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 222#L14 assume !(4 == main_~len~0 % 4294967296); 220#L14-2 assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 221#L13-2 assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; 219#L14 assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; 217#L14-2 [2018-11-23 13:56:53,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2018-11-23 13:56:53,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:53,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:53,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:53,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:53,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:53,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:53,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2018-11-23 13:56:53,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:53,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:53,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:53,282 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:53,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:53,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:56:53,311 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2018-11-23 13:56:53,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:56:53,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:56:53,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:53,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:56:53,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:56:53,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:56:54,638 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2018-11-23 13:56:56,686 WARN L180 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 103 DAG size of output: 32 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 ----- [2018-11-23 13:56:56,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 01:56:56 BoogieIcfgContainer [2018-11-23 13:56:56,723 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 13:56:56,723 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:56:56,723 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:56:56,723 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:56:56,724 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:56:51" (3/4) ... [2018-11-23 13:56:56,727 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 ----- [2018-11-23 13:56:56,782 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_663b2c4a-28a7-4384-9b95-9f7b351f264d/bin-2019/uautomizer/witness.graphml [2018-11-23 13:56:56,782 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:56:56,783 INFO L168 Benchmark]: Toolchain (without parser) took 5722.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 952.7 MB in the beginning and 935.6 MB in the end (delta: 17.1 MB). Peak memory consumption was 174.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:56:56,784 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:56:56,784 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.83 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:56:56,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.83 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:56:56,785 INFO L168 Benchmark]: Boogie Preprocessor took 13.37 ms. Allocated memory is still 1.0 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:56:56,785 INFO L168 Benchmark]: RCFGBuilder took 166.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:56:56,786 INFO L168 Benchmark]: BuchiAutomizer took 5300.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.8 MB in the end (delta: 199.7 MB). Peak memory consumption was 199.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:56:56,786 INFO L168 Benchmark]: Witness Printer took 58.90 ms. Allocated memory is still 1.2 GB. Free memory was 938.8 MB in the beginning and 935.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:56:56,790 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 980.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 160.83 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 941.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.83 ms. Allocated memory is still 1.0 GB. Free memory was 941.9 MB in the beginning and 939.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.37 ms. Allocated memory is still 1.0 GB. Free memory is still 939.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 166.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 939.2 MB in the beginning and 1.1 GB in the end (delta: -199.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5300.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 938.8 MB in the end (delta: 199.7 MB). Peak memory consumption was 199.7 MB. Max. memory is 11.5 GB. * Witness Printer took 58.90 ms. Allocated memory is still 1.2 GB. Free memory was 938.8 MB in the beginning and 935.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 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 4 terminating modules (4 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.4 modules have a trivial ranking function, the largest among these consists of 7 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.2s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 5.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. Highest rank in rank-based complementation 0. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 15 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 18 SDslu, 30 SDs, 0 SdLazy, 84 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: 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: 13]: 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 {len=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@468a36fa=1, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@3f9a3ee8=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 14]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;havoc main_~i~0; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~post1, main_#t~nondet0, main_~a~0, main_~len~0, main_~i~0; [L10] havoc main_~a~0; [L11] main_~len~0 := 0; [L12] havoc main_~i~0; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L10] havoc ~a~0; [L11] ~len~0 := 0; [L12] havoc ~i~0; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume !(4 == main_~len~0 % 4294967296); [?] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5;main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_#t~nondet0 % 256);havoc main_#t~nondet0; [?] assume 4 == main_~len~0 % 4294967296;main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume !(4 == main_~len~0 % 4294967296); [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0 := main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) := 0]; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] assume !!(0 != main_#t~nondet0 % 256); [L13] havoc main_#t~nondet0; [L14-L15] assume 4 == main_~len~0 % 4294967296; [L15] main_~len~0 := 0; [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND FALSE !(4 == main_~len~0 % 4294967296) [L16] assume 0 <= (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) && (if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] main_~a~0[(if main_~len~0 % 4294967296 % 4294967296 <= 2147483647 then main_~len~0 % 4294967296 % 4294967296 else main_~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] main_#t~post1 := main_~len~0; [L17] main_~len~0 := 1 + main_#t~post1; [L17] havoc main_#t~post1; [L13-L18] COND FALSE !(!(0 != main_#t~nondet0 % 256)) [L13] havoc main_#t~nondet0; [L14] COND TRUE 4 == main_~len~0 % 4294967296 [L15] main_~len~0 := 0; [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND FALSE !(4 == ~len~0 % 4294967296) [L16] assume 0 <= (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) && (if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296) < 5; [L16] ~a~0[(if ~len~0 % 4294967296 % 4294967296 <= 2147483647 then ~len~0 % 4294967296 % 4294967296 else ~len~0 % 4294967296 % 4294967296 - 4294967296)] := 0; [L17] #t~post1 := ~len~0; [L17] ~len~0 := 1 + #t~post1; [L17] havoc #t~post1; [L13-L18] COND FALSE !(!(0 != #t~nondet0 % 256)) [L13] havoc #t~nondet0; [L14] COND TRUE 4 == ~len~0 % 4294967296 [L15] ~len~0 := 0; [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L10] int a[5]; [L11] unsigned int len=0; [L12] int i; [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) Loop: [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND FALSE !(len==4) [L16] EXPR a[len] [L16] a[len]=0 [L17] len++ [L13] COND TRUE __VERIFIER_nondet_bool() [L14] COND TRUE len==4 [L15] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...