./Ultimate.py --spec ../../sv-benchmarks/c/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 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/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_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/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-1dbac8b [2018-11-10 01:10:16,859 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 01:10:16,861 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 01:10:16,868 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 01:10:16,868 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 01:10:16,869 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 01:10:16,870 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 01:10:16,871 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 01:10:16,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 01:10:16,873 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 01:10:16,873 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 01:10:16,874 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 01:10:16,874 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 01:10:16,875 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 01:10:16,876 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 01:10:16,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 01:10:16,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 01:10:16,878 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 01:10:16,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 01:10:16,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 01:10:16,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 01:10:16,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 01:10:16,883 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 01:10:16,884 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 01:10:16,884 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 01:10:16,885 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 01:10:16,885 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 01:10:16,886 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 01:10:16,886 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 01:10:16,887 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 01:10:16,887 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 01:10:16,888 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 01:10:16,888 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 01:10:16,888 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 01:10:16,889 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 01:10:16,889 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 01:10:16,889 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 01:10:16,901 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 01:10:16,901 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 01:10:16,901 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 01:10:16,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 01:10:16,902 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 01:10:16,902 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 01:10:16,902 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 01:10:16,902 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 01:10:16,902 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 01:10:16,903 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 01:10:16,903 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 01:10:16,903 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 01:10:16,903 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 01:10:16,903 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 01:10:16,903 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 01:10:16,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 01:10:16,904 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 01:10:16,905 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 01:10:16,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 01:10:16,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 01:10:16,905 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 01:10:16,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 01:10:16,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 01:10:16,905 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 01:10:16,906 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 01:10:16,906 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_0224e470-308f-40fd-a2a0-4a7147367c1c/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-10 01:10:16,933 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 01:10:16,941 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 01:10:16,944 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 01:10:16,945 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 01:10:16,945 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 01:10:16,946 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/../../sv-benchmarks/c/loops/nec11_false-unreach-call_false-termination.i [2018-11-10 01:10:16,990 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/data/2470c5564/4a345e4df7ad488cb6070572a4455a78/FLAG51f5faf62 [2018-11-10 01:10:17,387 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 01:10:17,388 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/sv-benchmarks/c/loops/nec11_false-unreach-call_false-termination.i [2018-11-10 01:10:17,391 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/data/2470c5564/4a345e4df7ad488cb6070572a4455a78/FLAG51f5faf62 [2018-11-10 01:10:17,401 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/data/2470c5564/4a345e4df7ad488cb6070572a4455a78 [2018-11-10 01:10:17,403 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 01:10:17,404 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 01:10:17,405 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 01:10:17,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 01:10:17,408 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 01:10:17,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17, skipping insertion in model container [2018-11-10 01:10:17,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 01:10:17,428 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 01:10:17,524 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:10:17,526 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 01:10:17,535 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 01:10:17,543 INFO L193 MainTranslator]: Completed translation [2018-11-10 01:10:17,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17 WrapperNode [2018-11-10 01:10:17,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 01:10:17,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 01:10:17,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 01:10:17,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 01:10:17,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,569 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 01:10:17,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 01:10:17,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 01:10:17,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 01:10:17,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... [2018-11-10 01:10:17,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 01:10:17,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 01:10:17,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 01:10:17,585 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 01:10:17,586 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/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-10 01:10:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 01:10:17,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 01:10:17,767 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 01:10:17,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:17 BoogieIcfgContainer [2018-11-10 01:10:17,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 01:10:17,768 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 01:10:17,768 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 01:10:17,771 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 01:10:17,771 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:10:17,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 01:10:17" (1/3) ... [2018-11-10 01:10:17,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1916f265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:10:17, skipping insertion in model container [2018-11-10 01:10:17,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:10:17,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:10:17" (2/3) ... [2018-11-10 01:10:17,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1916f265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 01:10:17, skipping insertion in model container [2018-11-10 01:10:17,773 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 01:10:17,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:17" (3/3) ... [2018-11-10 01:10:17,775 INFO L375 chiAutomizerObserver]: Analyzing ICFG nec11_false-unreach-call_false-termination.i [2018-11-10 01:10:17,825 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 01:10:17,826 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 01:10:17,826 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 01:10:17,826 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 01:10:17,826 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 01:10:17,826 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 01:10:17,827 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 01:10:17,827 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 01:10:17,827 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 01:10:17,839 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 01:10:17,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:10:17,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:17,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:17,863 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:10:17,863 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:10:17,864 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 01:10:17,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-10 01:10:17,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:10:17,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:17,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:17,865 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 01:10:17,865 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:10:17,872 INFO L793 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 5#L19-3true [2018-11-10 01:10:17,872 INFO L795 eck$LassoCheckResult]: Loop: 5#L19-3true assume true; 6#L19-1true assume !!(main_~c~0 % 256 != 0); 10#L21true assume !(main_~len~0 == 4); 8#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 := main_#t~post1 + 1;havoc main_#t~post1; 5#L19-3true [2018-11-10 01:10:17,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:17,878 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 01:10:17,879 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:17,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:17,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1114345, now seen corresponding path program 1 times [2018-11-10 01:10:17,959 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:17,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:17,978 INFO L82 PathProgramCache]: Analyzing trace with hash 889541547, now seen corresponding path program 1 times [2018-11-10 01:10:17,978 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:17,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:17,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:17,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,057 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 01:10:18,058 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 01:10:18,058 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 01:10:18,058 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 01:10:18,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 01:10:18,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 01:10:18,059 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 01:10:18,059 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 01:10:18,059 INFO L131 ssoRankerPreferences]: Filename of dumped script: nec11_false-unreach-call_false-termination.i_Iteration1_Lasso [2018-11-10 01:10:18,059 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 01:10:18,059 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 01:10:18,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:10:18,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:10:18,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:10:18,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:10:18,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:10:18,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 01:10:18,217 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 01:10:18,221 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 01:10:18,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:10:18,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:10:18,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:10:18,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:10:18,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:10:18,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:10:18,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:10:18,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:10:18,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:10:18,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:10:18,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:10:18,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:10:18,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:10:18,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:10:18,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:10:18,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:10:18,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:10:18,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:10:18,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:10:18,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:10:18,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:10:18,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:10:18,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:10:18,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:10:18,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:10:18,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:10:18,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:10:18,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:10:18,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:10:18,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:10:18,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:10:18,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:10:18,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:10:18,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:10:18,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:10:18,243 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:10:18,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:10:18,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:10:18,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 01:10:18,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:10:18,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:10:18,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:10:18,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 01:10:18,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 01:10:18,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 01:10:18,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 01:10:18,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 01:10:18,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 01:10:18,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 01:10:18,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 01:10:18,250 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 01:10:18,250 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 01:10:18,270 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 01:10:18,285 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 01:10:18,285 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-10 01:10:18,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 01:10:18,289 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-10 01:10:18,290 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 01:10:18,290 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~len~0) = -2*ULTIMATE.start_main_~len~0 + 7 Supporting invariants [] [2018-11-10 01:10:18,292 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 01:10:18,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:18,347 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-10 01:10:18,358 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 01:10:18,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-11-10 01:10:18,397 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 42 states and 50 transitions. Complement of second has 8 states. [2018-11-10 01:10:18,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 01:10:18,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 01:10:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-10 01:10:18,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-10 01:10:18,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:10:18,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-10 01:10:18,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:10:18,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-10 01:10:18,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 01:10:18,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 50 transitions. [2018-11-10 01:10:18,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:10:18,407 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 13 states and 16 transitions. [2018-11-10 01:10:18,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-10 01:10:18,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-10 01:10:18,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 16 transitions. [2018-11-10 01:10:18,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:10:18,409 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-10 01:10:18,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 16 transitions. [2018-11-10 01:10:18,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-10 01:10:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 01:10:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2018-11-10 01:10:18,427 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-10 01:10:18,427 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 16 transitions. [2018-11-10 01:10:18,427 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 01:10:18,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 16 transitions. [2018-11-10 01:10:18,428 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:10:18,428 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:18,428 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:18,428 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-10 01:10:18,428 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:10:18,428 INFO L793 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 102#L19-3 assume true; 112#L19-1 assume !!(main_~c~0 % 256 != 0); 103#L21 assume main_~len~0 == 4;main_~len~0 := 0; 104#L21-2 [2018-11-10 01:10:18,428 INFO L795 eck$LassoCheckResult]: Loop: 104#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 := main_#t~post1 + 1;havoc main_#t~post1; 108#L19-3 assume true; 109#L19-1 assume !!(main_~c~0 % 256 != 0); 113#L21 assume !(main_~len~0 == 4); 104#L21-2 [2018-11-10 01:10:18,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash 28694886, now seen corresponding path program 1 times [2018-11-10 01:10:18,429 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:18,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,449 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-10 01:10:18,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 01:10:18,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 01:10:18,452 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:10:18,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1495705, now seen corresponding path program 2 times [2018-11-10 01:10:18,452 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 01:10:18,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 01:10:18,499 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-11-10 01:10:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:18,509 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-10 01:10:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 01:10:18,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-10 01:10:18,511 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-10 01:10:18,512 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2018-11-10 01:10:18,512 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-10 01:10:18,512 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-10 01:10:18,512 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2018-11-10 01:10:18,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:10:18,512 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-11-10 01:10:18,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2018-11-10 01:10:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2018-11-10 01:10:18,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 01:10:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-10 01:10:18,516 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-10 01:10:18,516 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-10 01:10:18,516 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 01:10:18,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-10 01:10:18,516 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-10 01:10:18,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:18,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:18,517 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2018-11-10 01:10:18,517 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-10 01:10:18,517 INFO L793 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 139#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 140#L19-3 assume true; 149#L19-1 assume !!(main_~c~0 % 256 != 0); 143#L21 assume !(main_~len~0 == 4); 144#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 := main_#t~post1 + 1;havoc main_#t~post1; 147#L19-3 assume true; 148#L19-1 assume !!(main_~c~0 % 256 != 0); 141#L21 assume main_~len~0 == 4;main_~len~0 := 0; 142#L21-2 [2018-11-10 01:10:18,517 INFO L795 eck$LassoCheckResult]: Loop: 142#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 := main_#t~post1 + 1;havoc main_#t~post1; 145#L19-3 assume true; 146#L19-1 assume !!(main_~c~0 % 256 != 0); 151#L21 assume !(main_~len~0 == 4); 142#L21-2 [2018-11-10 01:10:18,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,517 INFO L82 PathProgramCache]: Analyzing trace with hash 384016510, now seen corresponding path program 1 times [2018-11-10 01:10:18,518 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:18,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:18,536 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/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-10 01:10:18,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:18,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:18,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:18,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2018-11-10 01:10:18,569 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:10:18,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1495705, now seen corresponding path program 3 times [2018-11-10 01:10:18,569 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:18,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 01:10:18,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 01:10:18,596 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-11-10 01:10:18,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:18,616 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-10 01:10:18,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 01:10:18,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 29 transitions. [2018-11-10 01:10:18,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2018-11-10 01:10:18,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 27 transitions. [2018-11-10 01:10:18,618 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-10 01:10:18,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-10 01:10:18,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 27 transitions. [2018-11-10 01:10:18,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:10:18,618 INFO L705 BuchiCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-10 01:10:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 27 transitions. [2018-11-10 01:10:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2018-11-10 01:10:18,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 01:10:18,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-10 01:10:18,619 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-10 01:10:18,620 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-10 01:10:18,620 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 01:10:18,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 23 transitions. [2018-11-10 01:10:18,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-10 01:10:18,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:18,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:18,620 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 1, 1, 1] [2018-11-10 01:10:18,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 1, 1] [2018-11-10 01:10:18,621 INFO L793 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 210#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 211#L19-3 assume true; 223#L19-1 assume !!(main_~c~0 % 256 != 0); 226#L21 assume !(main_~len~0 == 4); 225#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 := main_#t~post1 + 1;havoc main_#t~post1; 218#L19-3 assume true; 219#L19-1 assume !!(main_~c~0 % 256 != 0); 214#L21 assume !(main_~len~0 == 4); 215#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 := main_#t~post1 + 1;havoc main_#t~post1; 222#L19-3 assume true; 224#L19-1 assume !!(main_~c~0 % 256 != 0); 212#L21 assume main_~len~0 == 4;main_~len~0 := 0; 213#L21-2 [2018-11-10 01:10:18,621 INFO L795 eck$LassoCheckResult]: Loop: 213#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 := main_#t~post1 + 1;havoc main_#t~post1; 216#L19-3 assume true; 217#L19-1 assume !!(main_~c~0 % 256 != 0); 221#L21 assume !(main_~len~0 == 4); 227#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 := main_#t~post1 + 1;havoc main_#t~post1; 230#L19-3 assume true; 229#L19-1 assume !!(main_~c~0 % 256 != 0); 228#L21 assume main_~len~0 == 4;main_~len~0 := 0; 213#L21-2 [2018-11-10 01:10:18,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1020781674, now seen corresponding path program 2 times [2018-11-10 01:10:18,621 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,659 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:18,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:18,659 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/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-10 01:10:18,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 01:10:18,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 01:10:18,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:10:18,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:18,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:18,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-10 01:10:18,699 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:10:18,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1663919825, now seen corresponding path program 1 times [2018-11-10 01:10:18,699 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 01:10:18,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 01:10:18,741 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-10 01:10:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:18,757 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-10 01:10:18,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 01:10:18,757 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 37 transitions. [2018-11-10 01:10:18,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 01:10:18,759 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 33 states and 35 transitions. [2018-11-10 01:10:18,759 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2018-11-10 01:10:18,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-10 01:10:18,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 35 transitions. [2018-11-10 01:10:18,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:10:18,760 INFO L705 BuchiCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-10 01:10:18,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 35 transitions. [2018-11-10 01:10:18,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-10 01:10:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-10 01:10:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-10 01:10:18,763 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 01:10:18,763 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-10 01:10:18,763 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 01:10:18,763 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2018-11-10 01:10:18,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-10 01:10:18,764 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:18,764 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:18,764 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 1, 1, 1] [2018-11-10 01:10:18,764 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 1] [2018-11-10 01:10:18,764 INFO L793 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 311#L19-3 assume true; 324#L19-1 assume !!(main_~c~0 % 256 != 0); 314#L21 assume !(main_~len~0 == 4); 315#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 := main_#t~post1 + 1;havoc main_#t~post1; 323#L19-3 assume true; 336#L19-1 assume !!(main_~c~0 % 256 != 0); 338#L21 assume !(main_~len~0 == 4); 337#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 := main_#t~post1 + 1;havoc main_#t~post1; 319#L19-3 assume true; 320#L19-1 assume !!(main_~c~0 % 256 != 0); 322#L21 assume !(main_~len~0 == 4); 335#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 := main_#t~post1 + 1;havoc main_#t~post1; 334#L19-3 assume true; 321#L19-1 assume !!(main_~c~0 % 256 != 0); 312#L21 assume main_~len~0 == 4;main_~len~0 := 0; 313#L21-2 [2018-11-10 01:10:18,765 INFO L795 eck$LassoCheckResult]: Loop: 313#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 := main_#t~post1 + 1;havoc main_#t~post1; 317#L19-3 assume true; 318#L19-1 assume !!(main_~c~0 % 256 != 0); 325#L21 assume !(main_~len~0 == 4); 326#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 := main_#t~post1 + 1;havoc main_#t~post1; 333#L19-3 assume true; 332#L19-1 assume !!(main_~c~0 % 256 != 0); 331#L21 assume !(main_~len~0 == 4); 328#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 := main_#t~post1 + 1;havoc main_#t~post1; 330#L19-3 assume true; 329#L19-1 assume !!(main_~c~0 % 256 != 0); 327#L21 assume main_~len~0 == 4;main_~len~0 := 0; 313#L21-2 [2018-11-10 01:10:18,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1946765998, now seen corresponding path program 3 times [2018-11-10 01:10:18,765 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 01:10:18,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 01:10:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:18,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 01:10:18,802 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/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-10 01:10:18,810 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 01:10:18,819 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 01:10:18,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 01:10:18,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 01:10:18,825 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 01:10:18,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 01:10:18,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-10 01:10:18,841 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 01:10:18,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1385780167, now seen corresponding path program 2 times [2018-11-10 01:10:18,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 01:10:18,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 01:10:18,900 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand 6 states. [2018-11-10 01:10:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 01:10:18,914 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-10 01:10:18,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 01:10:18,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 45 transitions. [2018-11-10 01:10:18,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 17 [2018-11-10 01:10:18,915 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 41 states and 43 transitions. [2018-11-10 01:10:18,915 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-11-10 01:10:18,916 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-10 01:10:18,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 43 transitions. [2018-11-10 01:10:18,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 01:10:18,916 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-10 01:10:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 43 transitions. [2018-11-10 01:10:18,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-10 01:10:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 01:10:18,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-11-10 01:10:18,919 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-10 01:10:18,919 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-11-10 01:10:18,919 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 01:10:18,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 39 transitions. [2018-11-10 01:10:18,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-11-10 01:10:18,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 01:10:18,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 01:10:18,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 1, 1, 1] [2018-11-10 01:10:18,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 1] [2018-11-10 01:10:18,921 INFO L793 eck$LassoCheckResult]: Stem: 445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 439#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 440#L19-3 assume true; 451#L19-1 assume !!(main_~c~0 % 256 != 0); 443#L21 assume !(main_~len~0 == 4); 444#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 := main_#t~post1 + 1;havoc main_#t~post1; 448#L19-3 assume true; 449#L19-1 assume !!(main_~c~0 % 256 != 0); 475#L21 assume !(main_~len~0 == 4); 474#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 := main_#t~post1 + 1;havoc main_#t~post1; 473#L19-3 assume true; 472#L19-1 assume !!(main_~c~0 % 256 != 0); 471#L21 assume !(main_~len~0 == 4); 470#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 := main_#t~post1 + 1;havoc main_#t~post1; 469#L19-3 assume true; 464#L19-1 assume !!(main_~c~0 % 256 != 0); 468#L21 assume !(main_~len~0 == 4); 466#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 := main_#t~post1 + 1;havoc main_#t~post1; 463#L19-3 assume true; 450#L19-1 assume !!(main_~c~0 % 256 != 0); 441#L21 assume main_~len~0 == 4;main_~len~0 := 0; 442#L21-2 [2018-11-10 01:10:18,921 INFO L795 eck$LassoCheckResult]: Loop: 442#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 := main_#t~post1 + 1;havoc main_#t~post1; 446#L19-3 assume true; 447#L19-1 assume !!(main_~c~0 % 256 != 0); 454#L21 assume !(main_~len~0 == 4); 452#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 := main_#t~post1 + 1;havoc main_#t~post1; 453#L19-3 assume true; 467#L19-1 assume !!(main_~c~0 % 256 != 0); 465#L21 assume !(main_~len~0 == 4); 462#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 := main_#t~post1 + 1;havoc main_#t~post1; 461#L19-3 assume true; 460#L19-1 assume !!(main_~c~0 % 256 != 0); 459#L21 assume !(main_~len~0 == 4); 456#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 := main_#t~post1 + 1;havoc main_#t~post1; 458#L19-3 assume true; 457#L19-1 assume !!(main_~c~0 % 256 != 0); 455#L21 assume main_~len~0 == 4;main_~len~0 := 0; 442#L21-2 [2018-11-10 01:10:18,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1678585286, now seen corresponding path program 4 times [2018-11-10 01:10:18,922 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,923 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash -86965665, now seen corresponding path program 3 times [2018-11-10 01:10:18,936 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 01:10:18,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1818491356, now seen corresponding path program 5 times [2018-11-10 01:10:18,950 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 01:10:18,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 01:10:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 01:10:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 01:10:18,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 01:10:19,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-10 01:10:19,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2018-11-10 01:10:19,136 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2018-11-10 01:10:19,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-10 01:10:19,139 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 01:10:19,144 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:10:19,148 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:10:19,153 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:10:19,161 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 01:10:19,161 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:25, output treesize:30 [2018-11-10 01:10:19,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 01:10:19 BoogieIcfgContainer [2018-11-10 01:10:19,193 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 01:10:19,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 01:10:19,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 01:10:19,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 01:10:19,194 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:10:17" (3/4) ... [2018-11-10 01:10:19,197 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 01:10:19,232 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0224e470-308f-40fd-a2a0-4a7147367c1c/bin-2019/uautomizer/witness.graphml [2018-11-10 01:10:19,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 01:10:19,233 INFO L168 Benchmark]: Toolchain (without parser) took 1828.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 960.3 MB in the beginning and 936.4 MB in the end (delta: 23.9 MB). Peak memory consumption was 160.2 MB. Max. memory is 11.5 GB. [2018-11-10 01:10:19,234 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:10:19,234 INFO L168 Benchmark]: CACSL2BoogieTranslator took 138.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:10:19,234 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.82 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 01:10:19,235 INFO L168 Benchmark]: Boogie Preprocessor took 14.91 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:10:19,235 INFO L168 Benchmark]: RCFGBuilder took 182.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:10:19,235 INFO L168 Benchmark]: BuchiAutomizer took 1425.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.1 MB in the end (delta: 185.7 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:10:19,235 INFO L168 Benchmark]: Witness Printer took 38.34 ms. Allocated memory is still 1.2 GB. Free memory was 939.1 MB in the beginning and 936.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 01:10:19,237 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 138.80 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.6 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 25.82 ms. Allocated memory is still 1.0 GB. Free memory is still 949.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.91 ms. Allocated memory is still 1.0 GB. Free memory was 949.6 MB in the beginning and 946.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 182.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.3 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -177.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 1425.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.1 MB in the end (delta: 185.7 MB). Peak memory consumption was 185.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.34 ms. Allocated memory is still 1.2 GB. Free memory was 939.1 MB in the beginning and 936.4 MB 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * len + 7 and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. The remainder module has 37 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.3s and 6 iterations. TraceHistogramMax:5. Analysis of lassos took 1.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 16 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 37 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 30 SDtfs, 21 SDslu, 46 SDs, 0 SdLazy, 37 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital31 mio100 ax100 hnf100 lsp80 ukn75 mio100 lsp100 div247 bol100 ite100 ukn100 eq142 hnf47 smp78 dnf100 smp100 tf100 neg95 sie108 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 1 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 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@3763fc0b=0, \result=0, c=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@35cd6683=0, i=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 21]: Nonterminating execution 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) [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 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...