./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/loops/nec11_false-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_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/loops/nec11_false-unreach-call_false-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/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 377e57d4a3daf9b967866e1410a183dc7f79915c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-22 22:40:26,704 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 22:40:26,706 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 22:40:26,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 22:40:26,714 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 22:40:26,714 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 22:40:26,715 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 22:40:26,716 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 22:40:26,717 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 22:40:26,718 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 22:40:26,718 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 22:40:26,719 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 22:40:26,719 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 22:40:26,720 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 22:40:26,721 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 22:40:26,721 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 22:40:26,722 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 22:40:26,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 22:40:26,724 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 22:40:26,725 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 22:40:26,726 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 22:40:26,726 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 22:40:26,728 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 22:40:26,728 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 22:40:26,728 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 22:40:26,729 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 22:40:26,730 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 22:40:26,731 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 22:40:26,731 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 22:40:26,732 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 22:40:26,732 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 22:40:26,732 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 22:40:26,733 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 22:40:26,733 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 22:40:26,733 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 22:40:26,734 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 22:40:26,734 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-22 22:40:26,745 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 22:40:26,745 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 22:40:26,746 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 22:40:26,746 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 22:40:26,747 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 22:40:26,747 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 22:40:26,747 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 22:40:26,747 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 22:40:26,747 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 22:40:26,748 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 22:40:26,748 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 22:40:26,748 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 22:40:26,748 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-22 22:40:26,748 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 22:40:26,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 22:40:26,749 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-22 22:40:26,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 22:40:26,749 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 22:40:26,749 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 22:40:26,749 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 22:40:26,750 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-22 22:40:26,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 22:40:26,751 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 22:40:26,751 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 22:40:26,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 22:40:26,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 22:40:26,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 22:40:26,751 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 22:40:26,751 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 22:40:26,752 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 22:40:26,752 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 22:40:26,752 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 22:40:26,752 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_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/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 -> 377e57d4a3daf9b967866e1410a183dc7f79915c [2018-11-22 22:40:26,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 22:40:26,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 22:40:26,790 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 22:40:26,791 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 22:40:26,792 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 22:40:26,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/../../sv-benchmarks/c/loops/nec11_false-unreach-call_false-termination.i [2018-11-22 22:40:26,832 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/data/8301781ea/2c51b6c9990a4e51ac1cb6b78b355bad/FLAG39c7343e1 [2018-11-22 22:40:27,149 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 22:40:27,150 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/sv-benchmarks/c/loops/nec11_false-unreach-call_false-termination.i [2018-11-22 22:40:27,155 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/data/8301781ea/2c51b6c9990a4e51ac1cb6b78b355bad/FLAG39c7343e1 [2018-11-22 22:40:27,166 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/data/8301781ea/2c51b6c9990a4e51ac1cb6b78b355bad [2018-11-22 22:40:27,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 22:40:27,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 22:40:27,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 22:40:27,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 22:40:27,174 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 22:40:27,175 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17cfd07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27, skipping insertion in model container [2018-11-22 22:40:27,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 22:40:27,200 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 22:40:27,323 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:40:27,325 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 22:40:27,334 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 22:40:27,341 INFO L195 MainTranslator]: Completed translation [2018-11-22 22:40:27,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27 WrapperNode [2018-11-22 22:40:27,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 22:40:27,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 22:40:27,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 22:40:27,343 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 22:40:27,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,351 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 22:40:27,364 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 22:40:27,364 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 22:40:27,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 22:40:27,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... [2018-11-22 22:40:27,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 22:40:27,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 22:40:27,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 22:40:27,412 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 22:40:27,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/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-22 22:40:27,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 22:40:27,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 22:40:27,522 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 22:40:27,522 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-22 22:40:27,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:27 BoogieIcfgContainer [2018-11-22 22:40:27,522 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 22:40:27,523 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 22:40:27,523 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 22:40:27,525 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 22:40:27,525 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:40:27,525 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 10:40:27" (1/3) ... [2018-11-22 22:40:27,526 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ff0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:40:27, skipping insertion in model container [2018-11-22 22:40:27,526 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:40:27,526 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 10:40:27" (2/3) ... [2018-11-22 22:40:27,527 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@52ff0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 10:40:27, skipping insertion in model container [2018-11-22 22:40:27,527 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 22:40:27,527 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:27" (3/3) ... [2018-11-22 22:40:27,528 INFO L375 chiAutomizerObserver]: Analyzing ICFG nec11_false-unreach-call_false-termination.i [2018-11-22 22:40:27,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 22:40:27,560 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 22:40:27,560 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 22:40:27,560 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 22:40:27,560 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 22:40:27,560 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 22:40:27,560 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 22:40:27,560 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 22:40:27,560 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 22:40:27,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-22 22:40:27,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:40:27,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:40:27,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:40:27,587 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:40:27,587 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:40:27,587 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 22:40:27,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-22 22:40:27,588 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:40:27,588 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:40:27,588 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:40:27,589 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1] [2018-11-22 22:40:27,589 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:40:27,593 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 7#L19-2true [2018-11-22 22:40:27,593 INFO L796 eck$LassoCheckResult]: Loop: 7#L19-2true assume !!(0 != main_~c~0 % 256); 3#L21true assume 4 == main_~len~0;main_~len~0 := 0; 11#L21-2true assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 7#L19-2true [2018-11-22 22:40:27,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,597 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2018-11-22 22:40:27,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,667 INFO L82 PathProgramCache]: Analyzing trace with hash 39821, now seen corresponding path program 1 times [2018-11-22 22:40:27,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,686 INFO L82 PathProgramCache]: Analyzing trace with hash 963342, now seen corresponding path program 1 times [2018-11-22 22:40:27,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:40:27,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 22:40:27,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 22:40:27,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-22 22:40:27,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-22 22:40:27,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-22 22:40:27,791 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2018-11-22 22:40:27,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:40:27,816 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-22 22:40:27,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-22 22:40:27,818 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 22 transitions. [2018-11-22 22:40:27,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-22 22:40:27,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 7 states and 8 transitions. [2018-11-22 22:40:27,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-22 22:40:27,823 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-22 22:40:27,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2018-11-22 22:40:27,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:40:27,824 INFO L705 BuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2018-11-22 22:40:27,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2018-11-22 22:40:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2018-11-22 22:40:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-22 22:40:27,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2018-11-22 22:40:27,846 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-22 22:40:27,846 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2018-11-22 22:40:27,846 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 22:40:27,846 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2018-11-22 22:40:27,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-22 22:40:27,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:40:27,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:40:27,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:40:27,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 22:40:27,848 INFO L794 eck$LassoCheckResult]: Stem: 45#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 46#L19-2 assume !!(0 != main_~c~0 % 256); 43#L21 assume !(4 == main_~len~0); 44#L21-2 [2018-11-22 22:40:27,848 INFO L796 eck$LassoCheckResult]: Loop: 44#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 47#L19-2 assume !!(0 != main_~c~0 % 256); 48#L21 assume 4 == main_~len~0;main_~len~0 := 0; 44#L21-2 [2018-11-22 22:40:27,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,848 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2018-11-22 22:40:27,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 46451, now seen corresponding path program 2 times [2018-11-22 22:40:27,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,862 INFO L82 PathProgramCache]: Analyzing trace with hash 925831567, now seen corresponding path program 1 times [2018-11-22 22:40:27,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:27,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:40:27,886 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-22 22:40:27,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:40:27,886 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/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-22 22:40:27,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:40:27,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:40:27,913 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-22 22:40:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:40:27,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 2 [2018-11-22 22:40:27,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-22 22:40:27,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-22 22:40:27,969 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-22 22:40:27,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:40:27,989 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-11-22 22:40:27,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-22 22:40:27,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2018-11-22 22:40:27,990 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-22 22:40:27,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2018-11-22 22:40:27,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-22 22:40:27,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-22 22:40:27,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2018-11-22 22:40:27,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:40:27,991 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-22 22:40:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2018-11-22 22:40:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-11-22 22:40:27,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-22 22:40:27,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-11-22 22:40:27,992 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-22 22:40:27,992 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-11-22 22:40:27,992 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 22:40:27,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2018-11-22 22:40:27,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-22 22:40:27,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:40:27,993 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:40:27,993 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:40:27,993 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1] [2018-11-22 22:40:27,993 INFO L794 eck$LassoCheckResult]: Stem: 85#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 86#L19-2 assume !!(0 != main_~c~0 % 256); 91#L21 assume !(4 == main_~len~0); 88#L21-2 [2018-11-22 22:40:27,993 INFO L796 eck$LassoCheckResult]: Loop: 88#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 87#L19-2 assume !!(0 != main_~c~0 % 256); 83#L21 assume !(4 == main_~len~0); 84#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 90#L19-2 assume !!(0 != main_~c~0 % 256); 89#L21 assume 4 == main_~len~0;main_~len~0 := 0; 88#L21-2 [2018-11-22 22:40:27,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,993 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 2 times [2018-11-22 22:40:27,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:27,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:27,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:27,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1383897983, now seen corresponding path program 1 times [2018-11-22 22:40:27,999 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:27,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,000 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash -831686173, now seen corresponding path program 2 times [2018-11-22 22:40:28,011 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,011 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 22:40:28,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:40:28,053 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-22 22:40:28,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:40:28,053 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/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-22 22:40:28,059 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 22:40:28,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 22:40:28,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:40:28,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:40:28,070 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-22 22:40:28,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:40:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-22 22:40:28,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-22 22:40:28,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-22 22:40:28,122 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand 5 states. [2018-11-22 22:40:28,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:40:28,131 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-22 22:40:28,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-22 22:40:28,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 14 transitions. [2018-11-22 22:40:28,132 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-22 22:40:28,132 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 14 transitions. [2018-11-22 22:40:28,132 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-22 22:40:28,133 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-22 22:40:28,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-22 22:40:28,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:40:28,133 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-22 22:40:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-22 22:40:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-11-22 22:40:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-22 22:40:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-11-22 22:40:28,134 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-22 22:40:28,134 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-11-22 22:40:28,134 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 22:40:28,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 13 transitions. [2018-11-22 22:40:28,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-22 22:40:28,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:40:28,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:40:28,135 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:40:28,135 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 1] [2018-11-22 22:40:28,135 INFO L794 eck$LassoCheckResult]: Stem: 141#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 142#L19-2 assume !!(0 != main_~c~0 % 256); 150#L21 assume !(4 == main_~len~0); 145#L21-2 [2018-11-22 22:40:28,136 INFO L796 eck$LassoCheckResult]: Loop: 145#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 143#L19-2 assume !!(0 != main_~c~0 % 256); 144#L21 assume !(4 == main_~len~0); 148#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 149#L19-2 assume !!(0 != main_~c~0 % 256); 139#L21 assume !(4 == main_~len~0); 140#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 147#L19-2 assume !!(0 != main_~c~0 % 256); 146#L21 assume 4 == main_~len~0;main_~len~0 := 0; 145#L21-2 [2018-11-22 22:40:28,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,136 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2018-11-22 22:40:28,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash 313813491, now seen corresponding path program 2 times [2018-11-22 22:40:28,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,154 INFO L82 PathProgramCache]: Analyzing trace with hash 903627023, now seen corresponding path program 3 times [2018-11-22 22:40:28,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 22:40:28,207 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-22 22:40:28,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 22:40:28,207 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/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-22 22:40:28,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 22:40:28,219 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-22 22:40:28,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 22:40:28,220 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 22:40:28,224 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-22 22:40:28,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 22:40:28,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-22 22:40:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 22:40:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-22 22:40:28,299 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. cyclomatic complexity: 2 Second operand 6 states. [2018-11-22 22:40:28,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 22:40:28,318 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-22 22:40:28,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 22:40:28,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2018-11-22 22:40:28,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-22 22:40:28,319 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2018-11-22 22:40:28,319 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-22 22:40:28,320 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-22 22:40:28,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2018-11-22 22:40:28,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 22:40:28,320 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-22 22:40:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2018-11-22 22:40:28,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-22 22:40:28,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-22 22:40:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-22 22:40:28,321 INFO L728 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-22 22:40:28,322 INFO L608 BuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-22 22:40:28,322 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 22:40:28,322 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2018-11-22 22:40:28,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-22 22:40:28,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 22:40:28,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 22:40:28,323 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-22 22:40:28,323 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 1] [2018-11-22 22:40:28,323 INFO L794 eck$LassoCheckResult]: Stem: 213#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; 214#L19-2 assume !!(0 != main_~c~0 % 256); 211#L21 assume !(4 == main_~len~0); 212#L21-2 [2018-11-22 22:40:28,323 INFO L796 eck$LassoCheckResult]: Loop: 212#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 215#L19-2 assume !!(0 != main_~c~0 % 256); 225#L21 assume !(4 == main_~len~0); 224#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 223#L19-2 assume !!(0 != main_~c~0 % 256); 222#L21 assume !(4 == main_~len~0); 221#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 220#L19-2 assume !!(0 != main_~c~0 % 256); 219#L21 assume !(4 == main_~len~0); 217#L21-2 assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; 218#L19-2 assume !!(0 != main_~c~0 % 256); 216#L21 assume 4 == main_~len~0;main_~len~0 := 0; 212#L21-2 [2018-11-22 22:40:28,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,323 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 4 times [2018-11-22 22:40:28,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1326016769, now seen corresponding path program 3 times [2018-11-22 22:40:28,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 22:40:28,341 INFO L82 PathProgramCache]: Analyzing trace with hash -902292893, now seen corresponding path program 4 times [2018-11-22 22:40:28,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 22:40:28,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 22:40:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 22:40:28,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 22:40:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 22:40:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume 4 == main_~len~0;main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 ----- [2018-11-22 22:40:28,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.11 10:40:28 BoogieIcfgContainer [2018-11-22 22:40:28,502 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-22 22:40:28,502 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-22 22:40:28,502 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-22 22:40:28,502 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-22 22:40:28,503 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 10:40:27" (3/4) ... [2018-11-22 22:40:28,505 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~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume 4 == main_~len~0;main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 ----- [2018-11-22 22:40:28,547 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_eed2a07b-a521-4b0a-9bde-82f2a76d1b9d/bin-2019/uautomizer/witness.graphml [2018-11-22 22:40:28,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-22 22:40:28,548 INFO L168 Benchmark]: Toolchain (without parser) took 1378.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 959.1 MB in the beginning and 1.0 GB in the end (delta: -59.4 MB). Peak memory consumption was 97.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,549 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 22:40:28,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 170.92 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 21.53 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,550 INFO L168 Benchmark]: Boogie Preprocessor took 47.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,551 INFO L168 Benchmark]: RCFGBuilder took 110.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,551 INFO L168 Benchmark]: BuchiAutomizer took 979.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.9 MB). Peak memory consumption was 121.9 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,551 INFO L168 Benchmark]: Witness Printer took 45.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 22:40:28,556 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 170.92 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.4 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 21.53 ms. Allocated memory is still 1.0 GB. Free memory was 948.4 MB in the beginning and 945.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -211.7 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 110.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 979.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 121.9 MB). Peak memory consumption was 121.9 MB. Max. memory is 11.5 GB. * Witness Printer took 45.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 6 locations. The remainder module has 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.9s and 5 iterations. TraceHistogramMax:4. Analysis of lassos took 0.7s. 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: 18 SDtfs, 17 SDslu, 16 SDs, 0 SdLazy, 30 SolverSat, 9 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: 19]: 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@4dee17d7=0, \result=0, c=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@128daf08=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume 4 == main_~len~0;main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] havoc main_#res;havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0;havoc main_~a~0;main_~len~0 := 0;main_~c~0 := main_#t~nondet0;havoc main_#t~nondet0;havoc main_~i~0; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] havoc main_#res; [?] havoc main_#t~nondet0, main_#t~post1, main_~a~0, main_~len~0, main_~c~0, main_~i~0; [L13] havoc main_~a~0; [L14] main_~len~0 := 0; [L15] main_~c~0 := main_#t~nondet0; [L15] havoc main_#t~nondet0; [L16] havoc main_~i~0; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L13] havoc ~a~0; [L14] ~len~0 := 0; [L15] ~c~0 := #t~nondet0; [L15] havoc #t~nondet0; [L16] havoc ~i~0; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume !(4 == main_~len~0); [?] assume 0 <= main_~len~0 && main_~len~0 < 5;main_~a~0 := main_~a~0[main_~len~0 := 0];main_#t~post1 := main_~len~0;main_~len~0 := 1 + main_#t~post1;havoc main_#t~post1; [?] assume !!(0 != main_~c~0 % 256); [?] assume 4 == main_~len~0;main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume !(4 == main_~len~0); [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0 := main_~a~0[main_~len~0 := 0]; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] assume !!(0 != main_~c~0 % 256); [L21-L22] assume 4 == main_~len~0; [L22] main_~len~0 := 0; [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND FALSE !(4 == main_~len~0) [L24] assume 0 <= main_~len~0 && main_~len~0 < 5; [L24] main_~a~0[main_~len~0] := 0; [L26] main_#t~post1 := main_~len~0; [L26] main_~len~0 := 1 + main_#t~post1; [L26] havoc main_#t~post1; [L19-L27] COND FALSE !(!(0 != main_~c~0 % 256)) [L21] COND TRUE 4 == main_~len~0 [L22] main_~len~0 := 0; [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND FALSE !(4 == ~len~0) [L24] assume 0 <= ~len~0 && ~len~0 < 5; [L24] ~a~0[~len~0] := 0; [L26] #t~post1 := ~len~0; [L26] ~len~0 := 1 + #t~post1; [L26] havoc #t~post1; [L19-L27] COND FALSE !(!(0 != ~c~0 % 256)) [L21] COND TRUE 4 == ~len~0 [L22] ~len~0 := 0; [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] int a[5]; [L14] int len=0; [L15] _Bool c=__VERIFIER_nondet_bool(); [L16] int i; [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) Loop: [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND FALSE !(len==4) [L24] EXPR a[len] [L24] a[len]=0 [L26] len++ [L19] COND TRUE \read(c) [L21] COND TRUE len==4 [L22] len =0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...