./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e334a37fa3ef1f2b757af8cdc97575f5cde09f8b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:51,093 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:51,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:51,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:51,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:51,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:51,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:51,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:51,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:51,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:51,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:51,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:51,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:51,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:51,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:51,122 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:51,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:51,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:51,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:51,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:51,129 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:51,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:51,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:51,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:51,136 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:51,136 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:51,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:51,137 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:51,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:51,138 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:51,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:51,139 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:51,139 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:51,142 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:51,143 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:51,143 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:51,143 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:51,143 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:51,144 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:51,144 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:51,145 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:51,145 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 08:58:51,161 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:51,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:51,163 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:51,163 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:51,163 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:51,163 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 08:58:51,163 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 08:58:51,164 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 08:58:51,164 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 08:58:51,174 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 08:58:51,175 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 08:58:51,175 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:51,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:58:51,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:51,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:51,176 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 08:58:51,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:51,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:51,177 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 08:58:51,177 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:51,177 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:51,177 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 08:58:51,178 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 08:58:51,178 INFO L138 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_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e334a37fa3ef1f2b757af8cdc97575f5cde09f8b [2019-10-22 08:58:51,214 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:51,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:51,231 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:51,232 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:51,233 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:51,233 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2019-10-22 08:58:51,289 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/data/c296289f3/4200df091a934037b6b8c657f0600a60/FLAG15c6c3733 [2019-10-22 08:58:51,655 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:51,656 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2019-10-22 08:58:51,663 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/data/c296289f3/4200df091a934037b6b8c657f0600a60/FLAG15c6c3733 [2019-10-22 08:58:52,027 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/data/c296289f3/4200df091a934037b6b8c657f0600a60 [2019-10-22 08:58:52,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:52,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:52,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:52,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:52,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:52,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c714edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52, skipping insertion in model container [2019-10-22 08:58:52,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,050 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:52,063 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:52,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:52,215 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:52,235 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:52,323 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:52,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52 WrapperNode [2019-10-22 08:58:52,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:52,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:52,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:52,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:52,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:52,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:52,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:52,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:52,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,381 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,382 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... [2019-10-22 08:58:52,384 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:52,385 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:52,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:52,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:52,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/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 [2019-10-22 08:58:52,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:52,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:52,619 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:52,620 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-22 08:58:52,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:52 BoogieIcfgContainer [2019-10-22 08:58:52,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:52,622 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 08:58:52,622 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 08:58:52,626 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 08:58:52,627 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:52,627 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 08:58:52" (1/3) ... [2019-10-22 08:58:52,628 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b60a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:52, skipping insertion in model container [2019-10-22 08:58:52,628 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:52,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:52" (2/3) ... [2019-10-22 08:58:52,629 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b60a8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 08:58:52, skipping insertion in model container [2019-10-22 08:58:52,629 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 08:58:52,629 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:52" (3/3) ... [2019-10-22 08:58:52,631 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-Fig1.c [2019-10-22 08:58:52,682 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 08:58:52,682 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 08:58:52,682 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 08:58:52,683 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:52,683 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:52,683 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 08:58:52,683 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:52,683 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 08:58:52,698 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-10-22 08:58:52,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:52,723 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:52,723 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:52,731 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:58:52,731 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:52,731 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 08:58:52,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-10-22 08:58:52,732 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:52,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:52,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:52,734 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-10-22 08:58:52,734 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:52,742 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 5#L18-2true [2019-10-22 08:58:52,743 INFO L793 eck$LassoCheckResult]: Loop: 5#L18-2true assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 11#L19true assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 7#L19-2true main_~y~0 := main_~y~0 - 1; 5#L18-2true [2019-10-22 08:58:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-10-22 08:58:52,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50976848] [2019-10-22 08:58:52,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:52,868 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash 40299, now seen corresponding path program 1 times [2019-10-22 08:58:52,869 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290648064] [2019-10-22 08:58:52,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:52,885 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:52,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash 963820, now seen corresponding path program 1 times [2019-10-22 08:58:52,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138662108] [2019-10-22 08:58:52,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:52,901 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:52,946 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:52,947 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:52,947 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:52,947 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:52,947 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:52,948 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:52,948 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:52,948 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:52,948 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2019-10-22 08:58:52,948 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:52,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:52,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,174 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:53,174 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,180 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:53,187 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,188 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,193 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:53,198 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,198 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,208 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,208 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:53,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,213 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~x~0=0} Honda state: {ULTIMATE.start_main_~x~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:53,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,226 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,231 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,231 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,238 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,247 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:53,247 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:53,254 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:53,261 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:53,261 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:53,261 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:53,262 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:53,262 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:53,262 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,262 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:53,262 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:53,262 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration1_Loop [2019-10-22 08:58:53,262 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:53,262 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:53,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,344 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:53,349 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:53,351 INFO L120 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 [2019-10-22 08:58:53,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:53,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:53,353 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:53,353 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:53,358 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:53,358 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:53,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:53,365 INFO L120 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 [2019-10-22 08:58:53,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:53,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:53,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:53,366 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:53,369 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:53,369 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:53,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:53,384 INFO L120 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 [2019-10-22 08:58:53,385 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:53,385 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:53,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:53,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:53,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:53,386 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:53,387 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:53,388 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:53,388 INFO L120 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 [2019-10-22 08:58:53,389 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:53,389 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:53,389 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:53,390 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:53,390 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:53,390 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:53,390 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:53,392 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:53,393 INFO L120 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 [2019-10-22 08:58:53,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:53,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:53,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:53,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:53,394 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:53,395 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:53,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:53,402 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:53,407 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:53,407 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:53,409 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:53,409 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:53,410 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:53,410 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-10-22 08:58:53,413 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:53,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:53,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:53,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:53,462 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:53,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:53,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:53,496 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 [2019-10-22 08:58:53,498 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 3 states. [2019-10-22 08:58:53,600 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 3 states. Result 37 states and 54 transitions. Complement of second has 8 states. [2019-10-22 08:58:53,601 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 [2019-10-22 08:58:53,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 08:58:53,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 26 transitions. [2019-10-22 08:58:53,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 3 letters. [2019-10-22 08:58:53,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:53,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 4 letters. Loop has 3 letters. [2019-10-22 08:58:53,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:53,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 26 transitions. Stem has 1 letters. Loop has 6 letters. [2019-10-22 08:58:53,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:53,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 54 transitions. [2019-10-22 08:58:53,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:53,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 14 states and 20 transitions. [2019-10-22 08:58:53,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-10-22 08:58:53,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-10-22 08:58:53,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 20 transitions. [2019-10-22 08:58:53,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:53,617 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:58:53,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 20 transitions. [2019-10-22 08:58:53,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-22 08:58:53,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 08:58:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2019-10-22 08:58:53,643 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:58:53,643 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2019-10-22 08:58:53,643 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 08:58:53,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2019-10-22 08:58:53,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:53,645 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:53,645 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:53,646 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-10-22 08:58:53,646 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:58:53,646 INFO L791 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 93#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 91#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 98#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2019-10-22 08:58:53,647 INFO L793 eck$LassoCheckResult]: Loop: 99#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 99#L20-2 [2019-10-22 08:58:53,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,647 INFO L82 PathProgramCache]: Analyzing trace with hash 963347, now seen corresponding path program 1 times [2019-10-22 08:58:53,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994825471] [2019-10-22 08:58:53,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,648 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,671 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,671 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 1 times [2019-10-22 08:58:53,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964322010] [2019-10-22 08:58:53,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,685 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash 29863779, now seen corresponding path program 2 times [2019-10-22 08:58:53,686 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680673340] [2019-10-22 08:58:53,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:53,720 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:53,743 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:53,743 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:53,743 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:53,744 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:53,744 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:53,744 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,744 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:53,744 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:53,744 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2019-10-22 08:58:53,744 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:53,744 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:53,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:53,817 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:53,817 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,829 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:53,834 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,834 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:53,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,846 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,850 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,851 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:53,859 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,859 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:53,864 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:53,864 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:53,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:53,871 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:53,887 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:53,887 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,000 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:54,001 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:54,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:54,002 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:54,002 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:54,002 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:54,002 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,002 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:54,002 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:54,002 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration2_Loop [2019-10-22 08:58:54,002 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:54,002 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:54,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,054 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:54,054 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:54,055 INFO L120 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 [2019-10-22 08:58:54,056 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:54,056 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:54,056 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:54,057 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:54,058 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:54,058 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:54,063 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:54,064 INFO L120 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 [2019-10-22 08:58:54,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:54,065 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:54,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:54,065 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:54,067 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:54,067 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:54,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:54,073 INFO L120 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 [2019-10-22 08:58:54,073 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:54,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:54,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:54,074 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:54,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:54,075 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:54,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:54,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:54,080 INFO L120 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 [2019-10-22 08:58:54,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:54,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:54,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:54,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:54,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:54,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:54,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:54,087 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:54,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:54,091 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:54,092 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:54,092 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:54,093 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:54,093 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-10-22 08:58:54,093 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:54,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:54,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:54,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,121 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:54,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:54,122 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 08:58:54,122 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8 Second operand 2 states. [2019-10-22 08:58:54,136 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 20 transitions. cyclomatic complexity: 8. Second operand 2 states. Result 25 states and 39 transitions. Complement of second has 6 states. [2019-10-22 08:58:54,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-10-22 08:58:54,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 1 letters. [2019-10-22 08:58:54,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:54,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 5 letters. Loop has 1 letters. [2019-10-22 08:58:54,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:54,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2019-10-22 08:58:54,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:54,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 39 transitions. [2019-10-22 08:58:54,140 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:54,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 26 transitions. [2019-10-22 08:58:54,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-10-22 08:58:54,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-10-22 08:58:54,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 26 transitions. [2019-10-22 08:58:54,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:54,142 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 26 transitions. [2019-10-22 08:58:54,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 26 transitions. [2019-10-22 08:58:54,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2019-10-22 08:58:54,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 08:58:54,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2019-10-22 08:58:54,144 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-10-22 08:58:54,144 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 24 transitions. [2019-10-22 08:58:54,144 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 08:58:54,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 24 transitions. [2019-10-22 08:58:54,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:54,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:54,147 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:54,147 INFO L791 eck$LassoCheckResult]: Stem: 162#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 163#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 168#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 177#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 176#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2019-10-22 08:58:54,147 INFO L793 eck$LassoCheckResult]: Loop: 169#L20-3 main_~x~0 := main_~x~0 - 1; 170#L19-2 main_~y~0 := main_~y~0 - 1; 164#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 165#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 173#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 169#L20-3 [2019-10-22 08:58:54,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,148 INFO L82 PathProgramCache]: Analyzing trace with hash 29863777, now seen corresponding path program 1 times [2019-10-22 08:58:54,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,148 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433707773] [2019-10-22 08:58:54,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,169 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,170 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 1 times [2019-10-22 08:58:54,170 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,170 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466802510] [2019-10-22 08:58:54,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,170 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,185 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267692, now seen corresponding path program 1 times [2019-10-22 08:58:54,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024345625] [2019-10-22 08:58:54,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,186 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,206 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,239 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:54,239 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:54,239 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:54,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:54,240 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:54,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,240 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:54,240 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:54,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2019-10-22 08:58:54,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:54,240 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:54,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,353 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:54,353 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,362 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:54,362 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:54,375 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:54,375 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,497 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:54,499 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:54,500 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:54,500 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:54,500 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:54,500 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:54,500 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:54,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:54,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration3_Loop [2019-10-22 08:58:54,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:54,500 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:54,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,648 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:54,649 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:54,649 INFO L120 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 [2019-10-22 08:58:54,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:54,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:54,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:54,650 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:54,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:54,652 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:54,656 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:54,669 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:54,677 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:54,677 INFO L444 ModelExtractionUtils]: 2 out of 5 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:54,678 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:54,678 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:54,678 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:54,678 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 08:58:54,679 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:54,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:54,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:54,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:54,763 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:54,763 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-10-22 08:58:54,797 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 24 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 46 states and 68 transitions. Complement of second has 8 states. [2019-10-22 08:58:54,799 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 [2019-10-22 08:58:54,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 08:58:54,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2019-10-22 08:58:54,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 5 letters. [2019-10-22 08:58:54,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:54,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 08:58:54,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:54,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 5 letters. Loop has 10 letters. [2019-10-22 08:58:54,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:54,801 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 68 transitions. [2019-10-22 08:58:54,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:54,804 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 32 states and 46 transitions. [2019-10-22 08:58:54,807 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:58:54,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 08:58:54,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 46 transitions. [2019-10-22 08:58:54,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:54,808 INFO L688 BuchiCegarLoop]: Abstraction has 32 states and 46 transitions. [2019-10-22 08:58:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 46 transitions. [2019-10-22 08:58:54,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-10-22 08:58:54,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:58:54,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2019-10-22 08:58:54,812 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-10-22 08:58:54,813 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 44 transitions. [2019-10-22 08:58:54,814 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 08:58:54,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 44 transitions. [2019-10-22 08:58:54,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-10-22 08:58:54,815 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:54,815 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:54,815 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1] [2019-10-22 08:58:54,815 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 08:58:54,816 INFO L791 eck$LassoCheckResult]: Stem: 285#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 280#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 281#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 295#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 288#L20-3 main_~x~0 := main_~x~0 - 1; 289#L19-2 main_~y~0 := main_~y~0 - 1; 292#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 305#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 304#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 302#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2019-10-22 08:58:54,816 INFO L793 eck$LassoCheckResult]: Loop: 298#L20-3 main_~x~0 := main_~x~0 - 1; 290#L19-2 main_~y~0 := main_~y~0 - 1; 291#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 299#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 294#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 298#L20-3 [2019-10-22 08:58:54,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,816 INFO L82 PathProgramCache]: Analyzing trace with hash -363863338, now seen corresponding path program 2 times [2019-10-22 08:58:54,816 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701051234] [2019-10-22 08:58:54,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,885 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 08:58:54,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701051234] [2019-10-22 08:58:54,886 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:54,886 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:54,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595020897] [2019-10-22 08:58:54,890 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 08:58:54,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:54,891 INFO L82 PathProgramCache]: Analyzing trace with hash 53544460, now seen corresponding path program 2 times [2019-10-22 08:58:54,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:54,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790478784] [2019-10-22 08:58:54,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:54,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:54,903 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:54,943 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:54,943 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:54,944 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:54,944 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:54,944 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:54,944 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:54,944 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:54,944 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:54,944 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2019-10-22 08:58:54,944 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:54,944 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:54,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:54,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,054 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:55,054 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:55,064 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:55,064 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,070 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:55,070 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=7} Honda state: {ULTIMATE.start_main_#t~nondet1=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,076 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:55,076 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:55,095 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:55,095 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,138 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:55,140 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:55,140 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:55,140 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:55,140 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:55,140 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:55,140 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,141 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:55,141 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:55,141 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration4_Loop [2019-10-22 08:58:55,141 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:55,141 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:55,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,243 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:55,243 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:55,243 INFO L120 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 [2019-10-22 08:58:55,244 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,244 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,245 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-10-22 08:58:55,245 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,245 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-10-22 08:58:55,245 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,249 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:55,249 INFO L120 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 [2019-10-22 08:58:55,250 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,250 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,251 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,254 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:55,256 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:55,256 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:55,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:55,257 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:55,257 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:55,257 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2019-10-22 08:58:55,257 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:55,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,305 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:55,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-10-22 08:58:55,326 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 44 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 80 states and 118 transitions. Complement of second has 7 states. [2019-10-22 08:58:55,326 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 [2019-10-22 08:58:55,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:55,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2019-10-22 08:58:55,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 5 letters. [2019-10-22 08:58:55,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 15 letters. Loop has 5 letters. [2019-10-22 08:58:55,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 10 letters. Loop has 10 letters. [2019-10-22 08:58:55,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 118 transitions. [2019-10-22 08:58:55,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:58:55,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 54 states and 78 transitions. [2019-10-22 08:58:55,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 08:58:55,362 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 08:58:55,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 78 transitions. [2019-10-22 08:58:55,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:55,363 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 78 transitions. [2019-10-22 08:58:55,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 78 transitions. [2019-10-22 08:58:55,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2019-10-22 08:58:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 08:58:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 60 transitions. [2019-10-22 08:58:55,369 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 60 transitions. [2019-10-22 08:58:55,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:55,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:55,376 INFO L87 Difference]: Start difference. First operand 40 states and 60 transitions. Second operand 4 states. [2019-10-22 08:58:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:55,396 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2019-10-22 08:58:55,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:55,396 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 53 transitions. [2019-10-22 08:58:55,397 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:58:55,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 31 states and 46 transitions. [2019-10-22 08:58:55,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 08:58:55,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 08:58:55,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 46 transitions. [2019-10-22 08:58:55,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:55,399 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-10-22 08:58:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 46 transitions. [2019-10-22 08:58:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-10-22 08:58:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:58:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-10-22 08:58:55,402 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-10-22 08:58:55,402 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-10-22 08:58:55,402 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 08:58:55,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 46 transitions. [2019-10-22 08:58:55,403 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 08:58:55,403 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:55,403 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:55,403 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2019-10-22 08:58:55,403 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-10-22 08:58:55,404 INFO L791 eck$LassoCheckResult]: Stem: 542#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 538#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 539#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 551#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 559#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 546#L20-3 main_~x~0 := main_~x~0 - 1; 547#L19-2 main_~y~0 := main_~y~0 - 1; 567#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 565#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 549#L20-2 [2019-10-22 08:58:55,404 INFO L793 eck$LassoCheckResult]: Loop: 549#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 549#L20-2 [2019-10-22 08:58:55,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1840994920, now seen corresponding path program 3 times [2019-10-22 08:58:55,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678202768] [2019-10-22 08:58:55,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,416 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash 53, now seen corresponding path program 2 times [2019-10-22 08:58:55,417 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,417 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535522716] [2019-10-22 08:58:55,417 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,418 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,422 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1236267694, now seen corresponding path program 4 times [2019-10-22 08:58:55,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266960836] [2019-10-22 08:58:55,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,435 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,453 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:55,453 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:55,453 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:55,453 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:55,453 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:55,454 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,454 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:55,454 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:55,454 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2019-10-22 08:58:55,454 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:55,454 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:55,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,530 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:55,531 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,537 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:55,538 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:55,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:55,642 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:55,644 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:55,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:55,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:55,644 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:55,644 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:55,644 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,644 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:55,644 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:55,644 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration5_Loop [2019-10-22 08:58:55,644 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:55,645 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:55,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,697 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:55,698 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:55,698 INFO L120 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 [2019-10-22 08:58:55,699 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:55,699 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:55,699 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:55,699 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:55,699 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:55,699 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:55,700 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:55,702 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:55,704 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:55,704 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-10-22 08:58:55,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:55,704 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:55,705 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:55,705 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~y~0) = 2*ULTIMATE.start_main_~m~0 - 2*ULTIMATE.start_main_~y~0 + 1 Supporting invariants [] [2019-10-22 08:58:55,705 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:55,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,724 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,729 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,729 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 08:58:55,730 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-10-22 08:58:55,738 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2019-10-22 08:58:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:55,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:55,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:58:55,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2019-10-22 08:58:55,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,740 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,761 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,761 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 08:58:55,761 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-10-22 08:58:55,770 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 34 states and 50 transitions. Complement of second has 5 states. [2019-10-22 08:58:55,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:55,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:55,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-10-22 08:58:55,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 9 letters. Loop has 1 letters. [2019-10-22 08:58:55,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,771 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:55,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,792 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,793 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-10-22 08:58:55,793 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21 Second operand 2 states. [2019-10-22 08:58:55,803 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 46 transitions. cyclomatic complexity: 21. Second operand 2 states. Result 38 states and 54 transitions. Complement of second has 4 states. [2019-10-22 08:58:55,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-10-22 08:58:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2019-10-22 08:58:55,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 1 letters. [2019-10-22 08:58:55,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 10 letters. Loop has 1 letters. [2019-10-22 08:58:55,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 08:58:55,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:55,806 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 54 transitions. [2019-10-22 08:58:55,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:55,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 27 states and 37 transitions. [2019-10-22 08:58:55,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:55,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:55,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 37 transitions. [2019-10-22 08:58:55,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:55,808 INFO L688 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-10-22 08:58:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 37 transitions. [2019-10-22 08:58:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2019-10-22 08:58:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-22 08:58:55,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2019-10-22 08:58:55,810 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-22 08:58:55,810 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 29 transitions. [2019-10-22 08:58:55,810 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 08:58:55,810 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 29 transitions. [2019-10-22 08:58:55,812 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:55,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:55,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:55,813 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 2, 1, 1] [2019-10-22 08:58:55,813 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:55,814 INFO L791 eck$LassoCheckResult]: Stem: 798#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 799#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 806#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 803#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 804#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 802#L20-3 main_~x~0 := main_~x~0 - 1; 801#L19-2 main_~y~0 := main_~y~0 - 1; 796#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 797#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 807#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 810#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 813#L20-3 main_~x~0 := main_~x~0 - 1; 812#L19-2 main_~y~0 := main_~y~0 - 1; 811#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 808#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2019-10-22 08:58:55,814 INFO L793 eck$LassoCheckResult]: Loop: 800#L19-2 main_~y~0 := main_~y~0 - 1; 794#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 795#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 800#L19-2 [2019-10-22 08:58:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1970756676, now seen corresponding path program 1 times [2019-10-22 08:58:55,814 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125834205] [2019-10-22 08:58:55,814 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,829 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 2 times [2019-10-22 08:58:55,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719657545] [2019-10-22 08:58:55,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,831 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:55,836 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:55,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1390830772, now seen corresponding path program 2 times [2019-10-22 08:58:55,837 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,837 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822429067] [2019-10-22 08:58:55,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,901 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-22 08:58:55,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822429067] [2019-10-22 08:58:55,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119531508] [2019-10-22 08:58:55,902 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:55,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-22 08:58:55,936 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:55,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:58:55,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-22 08:58:55,944 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:55,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-10-22 08:58:55,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92773393] [2019-10-22 08:58:55,964 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:55,965 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:55,965 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:55,965 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:55,965 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:55,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:55,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:55,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:55,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2019-10-22 08:58:55,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:55,965 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:55,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:55,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,019 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:56,019 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,024 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,024 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,028 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:56,028 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,033 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,033 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,036 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:56,036 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 23 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,042 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,042 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,044 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:56,045 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet1=0} Honda state: {ULTIMATE.start_main_#t~nondet1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,050 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,050 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:56,056 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,081 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:56,082 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:56,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:56,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:56,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:56,083 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:56,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,083 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:56,083 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:56,083 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration6_Loop [2019-10-22 08:58:56,083 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:56,083 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,135 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:56,135 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:56,135 INFO L120 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 [2019-10-22 08:58:56,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:56,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:56,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:56,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:56,137 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:56,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:56,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:56,141 INFO L120 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 [2019-10-22 08:58:56,142 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:56,142 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:56,142 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:56,142 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:56,142 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:56,143 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:56,143 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:56,143 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:56,144 INFO L120 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 [2019-10-22 08:58:56,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:56,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:56,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:56,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:56,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:56,145 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:56,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:56,147 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:56,149 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:56,149 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:56,150 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:56,150 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:56,150 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:56,150 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 08:58:56,151 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:56,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,187 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:56,201 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:56,201 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-10-22 08:58:56,221 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 29 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 63 states and 85 transitions. Complement of second has 7 states. [2019-10-22 08:58:56,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:58:56,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 3 letters. [2019-10-22 08:58:56,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 18 letters. Loop has 3 letters. [2019-10-22 08:58:56,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 15 letters. Loop has 6 letters. [2019-10-22 08:58:56,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 85 transitions. [2019-10-22 08:58:56,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:56,228 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 44 states and 59 transitions. [2019-10-22 08:58:56,228 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:56,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:56,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2019-10-22 08:58:56,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:56,228 INFO L688 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2019-10-22 08:58:56,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2019-10-22 08:58:56,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-10-22 08:58:56,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-22 08:58:56,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 44 transitions. [2019-10-22 08:58:56,231 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 44 transitions. [2019-10-22 08:58:56,231 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:56,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:56,232 INFO L87 Difference]: Start difference. First operand 33 states and 44 transitions. Second operand 5 states. [2019-10-22 08:58:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,252 INFO L93 Difference]: Finished difference Result 54 states and 68 transitions. [2019-10-22 08:58:56,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:56,254 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 68 transitions. [2019-10-22 08:58:56,254 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:56,255 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 45 states and 58 transitions. [2019-10-22 08:58:56,255 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:56,255 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:56,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 58 transitions. [2019-10-22 08:58:56,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:56,255 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 58 transitions. [2019-10-22 08:58:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 58 transitions. [2019-10-22 08:58:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2019-10-22 08:58:56,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-22 08:58:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2019-10-22 08:58:56,260 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-22 08:58:56,260 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 53 transitions. [2019-10-22 08:58:56,260 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 08:58:56,260 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 53 transitions. [2019-10-22 08:58:56,261 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:56,261 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:56,261 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:56,262 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 2, 1] [2019-10-22 08:58:56,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:56,262 INFO L791 eck$LassoCheckResult]: Stem: 1103#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1104#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1112#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1108#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1109#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1133#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1107#L20-3 main_~x~0 := main_~x~0 - 1; 1106#L19-2 main_~y~0 := main_~y~0 - 1; 1101#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1102#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1124#L19-2 main_~y~0 := main_~y~0 - 1; 1127#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1123#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1121#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1117#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1120#L20-3 main_~x~0 := main_~x~0 - 1; 1119#L19-2 main_~y~0 := main_~y~0 - 1; 1118#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1115#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2019-10-22 08:58:56,262 INFO L793 eck$LassoCheckResult]: Loop: 1105#L19-2 main_~y~0 := main_~y~0 - 1; 1099#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1100#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1105#L19-2 [2019-10-22 08:58:56,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,262 INFO L82 PathProgramCache]: Analyzing trace with hash 715204654, now seen corresponding path program 3 times [2019-10-22 08:58:56,262 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60762241] [2019-10-22 08:58:56,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,279 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,280 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 3 times [2019-10-22 08:58:56,280 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253711952] [2019-10-22 08:58:56,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,280 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,285 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,285 INFO L82 PathProgramCache]: Analyzing trace with hash -670878974, now seen corresponding path program 4 times [2019-10-22 08:58:56,286 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810606311] [2019-10-22 08:58:56,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,286 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:58:56,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810606311] [2019-10-22 08:58:56,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2046658722] [2019-10-22 08:58:56,342 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:58:56,373 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-22 08:58:56,373 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-22 08:58:56,374 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-22 08:58:56,384 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 08:58:56,384 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-22 08:58:56,384 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497384352] [2019-10-22 08:58:56,404 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:56,405 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:56,405 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:56,405 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:56,405 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:56,405 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,405 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:56,405 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:56,405 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2019-10-22 08:58:56,405 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:56,406 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,469 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:56,469 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,479 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:56,479 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_13=1} Honda state: {v_rep~unnamed0~0~true_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:56,485 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,485 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-10-22 08:58:56,501 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:56,501 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,571 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:56,574 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:56,574 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:56,575 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:56,575 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:56,575 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:56,575 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,575 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:56,575 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:56,575 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration7_Loop [2019-10-22 08:58:56,575 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:56,575 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,638 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:56,638 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:56,638 INFO L120 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 [2019-10-22 08:58:56,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:56,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:56,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:56,640 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:56,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:56,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:56,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:56,643 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:56,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:56,650 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:56,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:56,651 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:56,651 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:56,651 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 08:58:56,651 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,683 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:56,700 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:56,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-10-22 08:58:56,720 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 46 states and 61 transitions. Complement of second has 7 states. [2019-10-22 08:58:56,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:56,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:58:56,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 3 letters. [2019-10-22 08:58:56,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,722 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:56,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:56,745 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:56,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:56,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:56,762 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:56,762 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20 Second operand 4 states. [2019-10-22 08:58:56,792 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 53 transitions. cyclomatic complexity: 20. Second operand 4 states. Result 74 states and 97 transitions. Complement of second has 9 states. [2019-10-22 08:58:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:56,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-10-22 08:58:56,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 3 letters. [2019-10-22 08:58:56,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 22 letters. Loop has 3 letters. [2019-10-22 08:58:56,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 19 letters. Loop has 6 letters. [2019-10-22 08:58:56,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:56,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 97 transitions. [2019-10-22 08:58:56,799 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:56,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 68 states and 89 transitions. [2019-10-22 08:58:56,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:56,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:56,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 68 states and 89 transitions. [2019-10-22 08:58:56,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:56,800 INFO L688 BuchiCegarLoop]: Abstraction has 68 states and 89 transitions. [2019-10-22 08:58:56,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states and 89 transitions. [2019-10-22 08:58:56,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2019-10-22 08:58:56,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-22 08:58:56,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 80 transitions. [2019-10-22 08:58:56,804 INFO L711 BuchiCegarLoop]: Abstraction has 60 states and 80 transitions. [2019-10-22 08:58:56,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:56,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:56,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:56,805 INFO L87 Difference]: Start difference. First operand 60 states and 80 transitions. Second operand 6 states. [2019-10-22 08:58:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:56,830 INFO L93 Difference]: Finished difference Result 149 states and 188 transitions. [2019-10-22 08:58:56,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:56,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2019-10-22 08:58:56,833 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:56,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 107 states and 137 transitions. [2019-10-22 08:58:56,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 08:58:56,835 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 08:58:56,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 137 transitions. [2019-10-22 08:58:56,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 08:58:56,835 INFO L688 BuchiCegarLoop]: Abstraction has 107 states and 137 transitions. [2019-10-22 08:58:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 137 transitions. [2019-10-22 08:58:56,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 83. [2019-10-22 08:58:56,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-10-22 08:58:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2019-10-22 08:58:56,840 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-10-22 08:58:56,840 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 111 transitions. [2019-10-22 08:58:56,841 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 08:58:56,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 111 transitions. [2019-10-22 08:58:56,841 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-10-22 08:58:56,841 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 08:58:56,841 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 08:58:56,842 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 3, 2, 2, 2, 2, 1] [2019-10-22 08:58:56,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-10-22 08:58:56,842 INFO L791 eck$LassoCheckResult]: Stem: 1705#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_~x~0, main_~y~0, main_~m~0;havoc main_~x~0;havoc main_~y~0;havoc main_~m~0;main_~y~0 := 0;main_~m~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~x~0 := main_~m~0; 1706#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1719#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1715#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1716#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1754#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1753#L20-3 main_~x~0 := main_~x~0 - 1; 1752#L19-2 main_~y~0 := main_~y~0 - 1; 1750#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1751#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1742#L19-2 main_~y~0 := main_~y~0 - 1; 1741#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1738#L19 assume 0 != main_#t~nondet1;havoc main_#t~nondet1; 1735#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1732#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1734#L20-2 assume !!(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2;main_~y~0 := 1 + main_~y~0; 1724#L20-2 assume !(main_~y~0 <= main_~m~0 && 0 != main_#t~nondet2);havoc main_#t~nondet2; 1727#L20-3 main_~x~0 := main_~x~0 - 1; 1726#L19-2 main_~y~0 := main_~y~0 - 1; 1725#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1722#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2019-10-22 08:58:56,842 INFO L793 eck$LassoCheckResult]: Loop: 1713#L19-2 main_~y~0 := main_~y~0 - 1; 1707#L18-2 assume !!(main_~x~0 >= 0 && main_~y~0 >= 0); 1708#L19 assume !(0 != main_#t~nondet1);havoc main_#t~nondet1; 1713#L19-2 [2019-10-22 08:58:56,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1768639598, now seen corresponding path program 5 times [2019-10-22 08:58:56,843 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,843 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331973590] [2019-10-22 08:58:56,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,843 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,857 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,858 INFO L82 PathProgramCache]: Analyzing trace with hash 58959, now seen corresponding path program 4 times [2019-10-22 08:58:56,858 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003064878] [2019-10-22 08:58:56,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,862 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1116494142, now seen corresponding path program 6 times [2019-10-22 08:58:56,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:56,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418179767] [2019-10-22 08:58:56,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:56,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:56,878 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:56,892 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:56,892 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:56,892 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:56,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:56,893 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-10-22 08:58:56,893 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,893 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:56,893 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:56,893 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2019-10-22 08:58:56,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:56,893 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,930 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:56,930 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,933 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,935 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-10-22 08:58:56,936 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_15=1} Honda state: {v_rep~unnamed0~0~true_15=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,940 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-10-22 08:58:56,940 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e996e1bb-5da8-4066-ba3a-14641d514770/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-10-22 08:58:56,946 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-10-22 08:58:56,968 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-10-22 08:58:56,969 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 08:58:56,969 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 08:58:56,969 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 08:58:56,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 08:58:56,970 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 08:58:56,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 08:58:56,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 08:58:56,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 08:58:56,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-Fig1.c_Iteration8_Loop [2019-10-22 08:58:56,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 08:58:56,970 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 08:58:56,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:56,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 08:58:57,019 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 08:58:57,019 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 08:58:57,019 INFO L120 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 [2019-10-22 08:58:57,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,021 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 08:58:57,022 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 08:58:57,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 08:58:57,025 INFO L120 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 [2019-10-22 08:58:57,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 08:58:57,026 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 08:58:57,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 08:58:57,026 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 08:58:57,026 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 08:58:57,027 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 08:58:57,027 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 08:58:57,028 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 08:58:57,030 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 08:58:57,030 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 08:58:57,031 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 08:58:57,031 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-10-22 08:58:57,031 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 08:58:57,031 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] [2019-10-22 08:58:57,032 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-10-22 08:58:57,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,067 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:57,084 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:57,084 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-10-22 08:58:57,099 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 101 states and 134 transitions. Complement of second has 7 states. [2019-10-22 08:58:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:57,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-10-22 08:58:57,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 08:58:57,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,101 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,126 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:57,140 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:57,140 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-10-22 08:58:57,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 128 states and 166 transitions. Complement of second has 9 states. [2019-10-22 08:58:57,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:57,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:57,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-10-22 08:58:57,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 08:58:57,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,168 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-10-22 08:58:57,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,192 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,196 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-22 08:58:57,197 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:58:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:57,211 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-10-22 08:58:57,211 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39 Second operand 4 states. [2019-10-22 08:58:57,230 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 83 states and 111 transitions. cyclomatic complexity: 39. Second operand 4 states. Result 139 states and 187 transitions. Complement of second has 8 states. [2019-10-22 08:58:57,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-10-22 08:58:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-10-22 08:58:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-10-22 08:58:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 3 letters. [2019-10-22 08:58:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 24 letters. Loop has 3 letters. [2019-10-22 08:58:57,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 21 letters. Loop has 6 letters. [2019-10-22 08:58:57,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 08:58:57,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 187 transitions. [2019-10-22 08:58:57,234 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:57,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 0 states and 0 transitions. [2019-10-22 08:58:57,234 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 08:58:57,234 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 08:58:57,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 08:58:57,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 08:58:57,234 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,235 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,235 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:58:57,235 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 08:58:57,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:58:57,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 08:58:57,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 08:58:57,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 08:58:57 BoogieIcfgContainer [2019-10-22 08:58:57,242 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 08:58:57,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:57,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:57,243 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:57,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:52" (3/4) ... [2019-10-22 08:58:57,247 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:58:57,248 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:57,250 INFO L168 Benchmark]: Toolchain (without parser) took 5215.14 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.1 MB). Free memory was 945.8 MB in the beginning and 888.9 MB in the end (delta: 56.8 MB). Peak memory consumption was 295.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,250 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,252 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,252 INFO L168 Benchmark]: Boogie Preprocessor took 25.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,253 INFO L168 Benchmark]: RCFGBuilder took 236.49 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,253 INFO L168 Benchmark]: BuchiAutomizer took 4620.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 888.9 MB in the end (delta: 250.7 MB). Peak memory consumption was 325.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:57,254 INFO L168 Benchmark]: Witness Printer took 5.03 ms. Allocated memory is still 1.3 GB. Free memory is still 888.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:57,256 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 289.12 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 945.8 MB in the beginning and 1.2 GB in the end (delta: -216.9 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.03 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.49 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: 19.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4620.76 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 74.4 MB). Free memory was 1.1 GB in the beginning and 888.9 MB in the end (delta: 250.7 MB). Peak memory consumption was 325.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.03 ms. Allocated memory is still 1.3 GB. Free memory is still 888.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (3 trivial, 6 deterministic, 2 nondeterministic). One deterministic module has affine ranking function 2 * y + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function y and consists of 4 locations. One deterministic module has affine ranking function y and consists of 5 locations. One nondeterministic module has affine ranking function 2 * m + -2 * y + 1 and consists of 3 locations. One nondeterministic module has affine ranking function y and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 9 iterations. TraceHistogramMax:5. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 71 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 7. Nontrivial modules had stage [5, 1, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 137 SDtfs, 155 SDslu, 81 SDs, 0 SdLazy, 157 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT5 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf99 lsp37 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf94 smp100 dnf112 smp100 tf111 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 13 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...