./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9907cb75ed84c11388be65b346c48a42942e3a6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:08:52,156 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:08:52,160 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:08:52,175 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:08:52,176 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:08:52,177 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:08:52,179 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:08:52,181 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:08:52,183 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:08:52,184 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:08:52,185 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:08:52,185 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:08:52,186 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:08:52,187 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:08:52,188 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:08:52,189 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:08:52,190 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:08:52,192 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:08:52,194 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:08:52,195 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:08:52,197 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:08:52,198 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:08:52,201 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:08:52,201 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:08:52,201 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:08:52,202 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:08:52,203 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:08:52,204 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:08:52,205 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:08:52,206 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:08:52,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:08:52,207 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:08:52,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:08:52,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:08:52,209 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:08:52,210 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:08:52,210 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:08:52,243 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:08:52,243 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:08:52,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:08:52,246 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:08:52,246 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:08:52,246 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:08:52,246 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:08:52,246 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:08:52,247 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:08:52,247 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:08:52,247 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:08:52,247 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:08:52,247 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:08:52,247 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:08:52,249 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:08:52,250 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:08:52,250 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:08:52,250 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:08:52,250 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:08:52,250 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:08:52,251 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:08:52,253 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:08:52,253 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:08:52,253 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:08:52,253 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:08:52,253 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:08:52,254 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:08:52,254 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:08:52,254 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:08:52,255 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:08:52,255 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:08:52,257 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:08:52,257 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c9907cb75ed84c11388be65b346c48a42942e3a6 [2019-01-02 00:08:52,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:08:52,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:08:52,338 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:08:52,340 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:08:52,340 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:08:52,341 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c [2019-01-02 00:08:52,401 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1e93091/bb309a26bf4546f6a3f89b33471119df/FLAG9cc0eecf0 [2019-01-02 00:08:52,876 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:08:52,877 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/seq-mthreaded/pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c [2019-01-02 00:08:52,898 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1e93091/bb309a26bf4546f6a3f89b33471119df/FLAG9cc0eecf0 [2019-01-02 00:08:53,205 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d1e93091/bb309a26bf4546f6a3f89b33471119df [2019-01-02 00:08:53,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:08:53,210 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:08:53,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:53,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:08:53,216 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:08:53,217 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:53,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c26b837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53, skipping insertion in model container [2019-01-02 00:08:53,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:53,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:08:53,286 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:08:53,670 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:53,683 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:08:53,800 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:08:53,826 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:08:53,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53 WrapperNode [2019-01-02 00:08:53,827 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:08:53,828 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:53,828 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:08:53,828 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:08:53,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:53,927 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:53,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:08:53,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:08:53,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:08:53,992 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:08:54,010 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,066 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... [2019-01-02 00:08:54,072 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:08:54,073 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:08:54,073 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:08:54,073 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:08:54,074 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-02 00:08:54,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:08:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:08:55,398 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:08:55,398 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2019-01-02 00:08:55,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:55 BoogieIcfgContainer [2019-01-02 00:08:55,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:08:55,400 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:08:55,400 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:08:55,404 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:08:55,404 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:55,405 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:08:53" (1/3) ... [2019-01-02 00:08:55,406 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b9a64fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:55, skipping insertion in model container [2019-01-02 00:08:55,406 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:55,406 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:08:53" (2/3) ... [2019-01-02 00:08:55,407 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3b9a64fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:08:55, skipping insertion in model container [2019-01-02 00:08:55,407 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:08:55,407 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:55" (3/3) ... [2019-01-02 00:08:55,410 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c [2019-01-02 00:08:55,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:08:55,473 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:08:55,473 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:08:55,474 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:08:55,474 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:08:55,475 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:08:55,475 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:08:55,475 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:08:55,475 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:08:55,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states. [2019-01-02 00:08:55,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-02 00:08:55,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:55,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:55,544 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:55,544 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:55,544 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:08:55,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 139 states. [2019-01-02 00:08:55,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2019-01-02 00:08:55,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:55,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:55,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-02 00:08:55,561 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:55,571 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 12#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 15#L329true assume !(0 == ~r1~0);init_~tmp~0 := 0; 17#L329-1true init_#res := init_~tmp~0; 21#L494true main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 69#L570-2true [2019-01-02 00:08:55,572 INFO L796 eck$LassoCheckResult]: Loop: 69#L570-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 110#L126true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 65#L130true assume !(node1_~m1~0 != ~nomsg~0); 64#L130-1true ~mode1~0 := 0; 107#L126-2true havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 24#L158true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 29#L161true assume !(node2_~m2~0 != ~nomsg~0); 28#L161-1true ~mode2~0 := 0; 22#L158-2true havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 133#L192true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 120#L195true assume !(node3_~m3~0 != ~nomsg~0); 119#L195-1true ~mode3~0 := 0; 112#L192-2true havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 81#L226true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 54#L229true assume !(node4_~m4~0 != ~nomsg~0); 68#L229-1true ~mode4~0 := 0; 78#L226-2true havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 35#L260true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 11#L263true assume !(node5_~m5~0 != ~nomsg~0); 6#L263-1true ~mode5~0 := 0; 33#L260-2true havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 106#L294true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 100#L297true assume !(node6_~m6~0 != ~nomsg~0); 99#L297-1true ~mode6~0 := 0; 122#L294-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 45#L502true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 47#L502-1true check_#res := check_~tmp~1; 126#L514true main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 85#L603true assume !(0 == assert_~arg % 256); 58#L598true main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 69#L570-2true [2019-01-02 00:08:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:55,586 INFO L82 PathProgramCache]: Analyzing trace with hash 28934070, now seen corresponding path program 1 times [2019-01-02 00:08:55,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:55,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:55,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:55,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:55,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:55,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:55,943 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:08:55,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:55,944 INFO L82 PathProgramCache]: Analyzing trace with hash 448128979, now seen corresponding path program 1 times [2019-01-02 00:08:55,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:55,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:55,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:55,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:56,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:56,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:56,098 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:08:56,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:08:56,120 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 4 states. [2019-01-02 00:08:56,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:56,494 INFO L93 Difference]: Finished difference Result 141 states and 236 transitions. [2019-01-02 00:08:56,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:08:56,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 236 transitions. [2019-01-02 00:08:56,505 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-02 00:08:56,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 134 states and 189 transitions. [2019-01-02 00:08:56,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-01-02 00:08:56,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-01-02 00:08:56,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 189 transitions. [2019-01-02 00:08:56,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:56,518 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-01-02 00:08:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 189 transitions. [2019-01-02 00:08:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-01-02 00:08:56,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-02 00:08:56,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 189 transitions. [2019-01-02 00:08:56,564 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-01-02 00:08:56,565 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 189 transitions. [2019-01-02 00:08:56,565 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:08:56,565 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 189 transitions. [2019-01-02 00:08:56,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-02 00:08:56,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:56,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:56,571 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:56,571 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:56,572 INFO L794 eck$LassoCheckResult]: Stem: 423#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 316#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 317#L329 assume 0 == ~r1~0; 320#L330 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 391#L331 assume ~id1~0 >= 0; 314#L332 assume 0 == ~st1~0; 315#L333 assume ~send1~0 == ~id1~0; 362#L334 assume 0 == ~mode1~0 % 256; 363#L335 assume ~id2~0 >= 0; 415#L336 assume 0 == ~st2~0; 354#L337 assume ~send2~0 == ~id2~0; 355#L338 assume 0 == ~mode2~0 % 256; 395#L339 assume ~id3~0 >= 0; 318#L340 assume 0 == ~st3~0; 319#L341 assume ~send3~0 == ~id3~0; 390#L342 assume 0 == ~mode3~0 % 256; 310#L343 assume ~id4~0 >= 0; 311#L344 assume 0 == ~st4~0; 360#L345 assume ~send4~0 == ~id4~0; 361#L346 assume 0 == ~mode4~0 % 256; 414#L347 assume ~id5~0 >= 0; 351#L348 assume 0 == ~st5~0; 352#L349 assume ~send5~0 == ~id5~0; 394#L350 assume 0 == ~mode5~0 % 256; 343#L351 assume ~id6~0 >= 0; 344#L352 assume 0 == ~st6~0; 388#L353 assume ~send6~0 == ~id6~0; 308#L354 assume 0 == ~mode6~0 % 256; 309#L355 assume ~id1~0 != ~id2~0; 358#L356 assume ~id1~0 != ~id3~0; 359#L357 assume ~id1~0 != ~id4~0; 412#L358 assume ~id1~0 != ~id5~0; 349#L359 assume ~id1~0 != ~id6~0; 350#L360 assume ~id2~0 != ~id3~0; 393#L361 assume ~id2~0 != ~id4~0; 341#L362 assume ~id2~0 != ~id5~0; 342#L363 assume ~id2~0 != ~id6~0; 387#L364 assume ~id3~0 != ~id4~0; 303#L365 assume ~id3~0 != ~id5~0; 304#L366 assume ~id3~0 != ~id6~0; 384#L367 assume ~id4~0 != ~id5~0; 385#L368 assume ~id4~0 != ~id6~0; 410#L369 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 327#L329-1 init_#res := init_~tmp~0; 328#L494 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 334#L570-2 [2019-01-02 00:08:56,572 INFO L796 eck$LassoCheckResult]: Loop: 334#L570-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 400#L126 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 396#L130 assume !(node1_~m1~0 != ~nomsg~0); 330#L130-1 ~mode1~0 := 0; 383#L126-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 339#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 340#L161 assume !(node2_~m2~0 != ~nomsg~0); 347#L161-1 ~mode2~0 := 0; 335#L158-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 336#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 424#L195 assume !(node3_~m3~0 != ~nomsg~0); 299#L195-1 ~mode3~0 := 0; 404#L192-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 411#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 386#L229 assume !(node4_~m4~0 != ~nomsg~0); 306#L229-1 ~mode4~0 := 0; 346#L226-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 357#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 312#L263 assume !(node5_~m5~0 != ~nomsg~0); 301#L263-1 ~mode5~0 := 0; 302#L260-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 353#L294 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 422#L297 assume !(node6_~m6~0 != ~nomsg~0); 325#L297-1 ~mode6~0 := 0; 399#L294-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 372#L502 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 373#L502-1 check_#res := check_~tmp~1; 378#L514 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 413#L603 assume !(0 == assert_~arg % 256); 389#L598 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 334#L570-2 [2019-01-02 00:08:56,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 1 times [2019-01-02 00:08:56,573 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:56,573 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:56,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:56,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:56,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:56,836 INFO L82 PathProgramCache]: Analyzing trace with hash 448128979, now seen corresponding path program 2 times [2019-01-02 00:08:56,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:56,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:56,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:56,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:57,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:57,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:57,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-02 00:08:57,019 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-02 00:08:57,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-02 00:08:57,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-02 00:08:57,020 INFO L87 Difference]: Start difference. First operand 134 states and 189 transitions. cyclomatic complexity: 56 Second operand 5 states. [2019-01-02 00:08:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:08:57,124 INFO L93 Difference]: Finished difference Result 137 states and 191 transitions. [2019-01-02 00:08:57,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-02 00:08:57,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 137 states and 191 transitions. [2019-01-02 00:08:57,131 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-02 00:08:57,133 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 137 states to 134 states and 187 transitions. [2019-01-02 00:08:57,133 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 134 [2019-01-02 00:08:57,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 134 [2019-01-02 00:08:57,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 134 states and 187 transitions. [2019-01-02 00:08:57,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:08:57,136 INFO L705 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-01-02 00:08:57,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states and 187 transitions. [2019-01-02 00:08:57,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-01-02 00:08:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-01-02 00:08:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2019-01-02 00:08:57,154 INFO L728 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-01-02 00:08:57,157 INFO L608 BuchiCegarLoop]: Abstraction has 134 states and 187 transitions. [2019-01-02 00:08:57,157 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:08:57,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 134 states and 187 transitions. [2019-01-02 00:08:57,159 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 89 [2019-01-02 00:08:57,162 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:08:57,162 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:08:57,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:57,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:08:57,165 INFO L794 eck$LassoCheckResult]: Stem: 706#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~alive4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~alive5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0;~alive6~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 599#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~nondet31, main_#t~nondet32, main_#t~nondet33, main_#t~nondet34, main_#t~nondet35, main_#t~nondet36, main_#t~nondet37, main_#t~nondet38, main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~ret42, main_#t~ret43, main_#t~post44, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet11;havoc main_#t~nondet11;~id1~0 := main_#t~nondet12;havoc main_#t~nondet12;~st1~0 := main_#t~nondet13;havoc main_#t~nondet13;~send1~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode1~0 := main_#t~nondet15;havoc main_#t~nondet15;~alive1~0 := main_#t~nondet16;havoc main_#t~nondet16;~id2~0 := main_#t~nondet17;havoc main_#t~nondet17;~st2~0 := main_#t~nondet18;havoc main_#t~nondet18;~send2~0 := main_#t~nondet19;havoc main_#t~nondet19;~mode2~0 := main_#t~nondet20;havoc main_#t~nondet20;~alive2~0 := main_#t~nondet21;havoc main_#t~nondet21;~id3~0 := main_#t~nondet22;havoc main_#t~nondet22;~st3~0 := main_#t~nondet23;havoc main_#t~nondet23;~send3~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode3~0 := main_#t~nondet25;havoc main_#t~nondet25;~alive3~0 := main_#t~nondet26;havoc main_#t~nondet26;~id4~0 := main_#t~nondet27;havoc main_#t~nondet27;~st4~0 := main_#t~nondet28;havoc main_#t~nondet28;~send4~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode4~0 := main_#t~nondet30;havoc main_#t~nondet30;~alive4~0 := main_#t~nondet31;havoc main_#t~nondet31;~id5~0 := main_#t~nondet32;havoc main_#t~nondet32;~st5~0 := main_#t~nondet33;havoc main_#t~nondet33;~send5~0 := main_#t~nondet34;havoc main_#t~nondet34;~mode5~0 := main_#t~nondet35;havoc main_#t~nondet35;~alive5~0 := main_#t~nondet36;havoc main_#t~nondet36;~id6~0 := main_#t~nondet37;havoc main_#t~nondet37;~st6~0 := main_#t~nondet38;havoc main_#t~nondet38;~send6~0 := main_#t~nondet39;havoc main_#t~nondet39;~mode6~0 := main_#t~nondet40;havoc main_#t~nondet40;~alive6~0 := main_#t~nondet41;havoc main_#t~nondet41;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 600#L329 assume 0 == ~r1~0; 603#L330 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 + ~alive4~0 % 256 + ~alive5~0 % 256 + ~alive6~0 % 256 >= 1; 674#L331 assume ~id1~0 >= 0; 597#L332 assume 0 == ~st1~0; 598#L333 assume ~send1~0 == ~id1~0; 645#L334 assume 0 == ~mode1~0 % 256; 646#L335 assume ~id2~0 >= 0; 698#L336 assume 0 == ~st2~0; 637#L337 assume ~send2~0 == ~id2~0; 638#L338 assume 0 == ~mode2~0 % 256; 678#L339 assume ~id3~0 >= 0; 601#L340 assume 0 == ~st3~0; 602#L341 assume ~send3~0 == ~id3~0; 673#L342 assume 0 == ~mode3~0 % 256; 593#L343 assume ~id4~0 >= 0; 594#L344 assume 0 == ~st4~0; 643#L345 assume ~send4~0 == ~id4~0; 644#L346 assume 0 == ~mode4~0 % 256; 697#L347 assume ~id5~0 >= 0; 634#L348 assume 0 == ~st5~0; 635#L349 assume ~send5~0 == ~id5~0; 677#L350 assume 0 == ~mode5~0 % 256; 628#L351 assume ~id6~0 >= 0; 629#L352 assume 0 == ~st6~0; 671#L353 assume ~send6~0 == ~id6~0; 591#L354 assume 0 == ~mode6~0 % 256; 592#L355 assume ~id1~0 != ~id2~0; 641#L356 assume ~id1~0 != ~id3~0; 642#L357 assume ~id1~0 != ~id4~0; 695#L358 assume ~id1~0 != ~id5~0; 632#L359 assume ~id1~0 != ~id6~0; 633#L360 assume ~id2~0 != ~id3~0; 676#L361 assume ~id2~0 != ~id4~0; 624#L362 assume ~id2~0 != ~id5~0; 625#L363 assume ~id2~0 != ~id6~0; 670#L364 assume ~id3~0 != ~id4~0; 589#L365 assume ~id3~0 != ~id5~0; 590#L366 assume ~id3~0 != ~id6~0; 667#L367 assume ~id4~0 != ~id5~0; 668#L368 assume ~id4~0 != ~id6~0; 694#L369 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 610#L329-1 init_#res := init_~tmp~0; 611#L494 main_#t~ret42 := init_#res;main_~i2~0 := main_#t~ret42;havoc main_#t~ret42;assume 0 != main_~i2~0;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 617#L570-2 [2019-01-02 00:08:57,170 INFO L796 eck$LassoCheckResult]: Loop: 617#L570-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 683#L126 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 679#L130 assume !(node1_~m1~0 != ~nomsg~0); 613#L130-1 ~mode1~0 := 0; 666#L126-2 havoc node2_#t~ite1, node2_#t~ite2, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 622#L158 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 623#L161 assume !(node2_~m2~0 != ~nomsg~0); 630#L161-1 ~mode2~0 := 0; 618#L158-2 havoc node3_#t~ite3, node3_#t~ite4, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 619#L192 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 707#L195 assume !(node3_~m3~0 != ~nomsg~0); 582#L195-1 ~mode3~0 := 0; 687#L192-2 havoc node4_#t~ite5, node4_#t~ite6, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 693#L226 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 669#L229 assume !(node4_~m4~0 != ~nomsg~0); 585#L229-1 ~mode4~0 := 0; 627#L226-2 havoc node5_#t~ite7, node5_#t~ite8, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 640#L260 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 595#L263 assume !(node5_~m5~0 != ~nomsg~0); 587#L263-1 ~mode5~0 := 0; 588#L260-2 havoc node6_#t~ite9, node6_#t~ite10, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 636#L294 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 705#L297 assume !(node6_~m6~0 != ~nomsg~0); 608#L297-1 ~mode6~0 := 0; 682#L294-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 655#L502 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 656#L503 assume ~r1~0 < 6;check_~tmp~1 := 1; 660#L502-1 check_#res := check_~tmp~1; 661#L514 main_#t~ret43 := check_#res;main_~c1~0 := main_#t~ret43;havoc main_#t~ret43;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 696#L603 assume !(0 == assert_~arg % 256); 672#L598 main_#t~post44 := main_~i2~0;main_~i2~0 := 1 + main_#t~post44;havoc main_#t~post44; 617#L570-2 [2019-01-02 00:08:57,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:57,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1302395264, now seen corresponding path program 2 times [2019-01-02 00:08:57,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:57,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:57,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:57,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:57,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:57,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:57,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:57,296 INFO L82 PathProgramCache]: Analyzing trace with hash 623769500, now seen corresponding path program 1 times [2019-01-02 00:08:57,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:57,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:57,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:57,299 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:08:57,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:57,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:08:57,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:08:57,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1738677955, now seen corresponding path program 1 times [2019-01-02 00:08:57,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:08:57,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:08:57,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:57,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:08:57,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:08:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:08:57,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:08:57,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:08:57,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:08:58,328 WARN L181 SmtUtils]: Spent 854.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 157 [2019-01-02 00:08:59,890 WARN L181 SmtUtils]: Spent 1.54 s on a formula simplification. DAG size of input: 139 DAG size of output: 134 [2019-01-02 00:08:59,902 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:08:59,903 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:08:59,904 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:08:59,904 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:08:59,904 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-02 00:08:59,904 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:08:59,904 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:08:59,905 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:08:59,905 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:08:59,905 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:08:59,905 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:08:59,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:59,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:59,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-01-02 00:08:59,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-01-02 00:08:59,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:08:59,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,058 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,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-01-02 00:09:00,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,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-01-02 00:09:00,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-01-02 00:09:00,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,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-01-02 00:09:00,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:00,589 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:01,095 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:01,310 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:01,311 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-02 00:09:01,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-02 00:09:01,318 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-01-02 00:09:01,346 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-02 00:09:01,347 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-02 00:09:01,506 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-02 00:09:01,507 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:09:01,508 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:09:01,508 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:09:01,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:09:01,508 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:09:01,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:09:01,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:09:01,509 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:09:01,509 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.6_false-unreach-call.2.ufo.BOUNDED-12.pals_true-termination.c_Iteration3_Loop [2019-01-02 00:09:01,509 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:09:01,509 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:09:01,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,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-01-02 00:09:01,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:01,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:09:02,558 WARN L181 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:03,072 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-01-02 00:09:03,118 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:09:03,124 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:09:03,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,146 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:03,146 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:03,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,151 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,161 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:03,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:03,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,176 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,176 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,183 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,190 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:03,190 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:03,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,194 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:09:03,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,197 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:09:03,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,204 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,206 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:03,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:03,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:03,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:03,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,225 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:09:03,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:09:03,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:09:03,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:09:03,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:09:03,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:09:03,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:09:03,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:09:03,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:09:03,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:09:03,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:09:03,261 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:09:03,265 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-02 00:09:03,266 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-02 00:09:03,268 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:09:03,268 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-02 00:09:03,269 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:09:03,269 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2019-01-02 00:09:03,271 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-02 00:09:03,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:09:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:03,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:03,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:09:03,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:09:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:09:03,611 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-01-02 00:09:03,612 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 134 states and 187 transitions. cyclomatic complexity: 54 Second operand 3 states. [2019-01-02 00:09:03,718 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 134 states and 187 transitions. cyclomatic complexity: 54. Second operand 3 states. Result 223 states and 330 transitions. Complement of second has 4 states. [2019-01-02 00:09:03,720 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-01-02 00:09:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:09:03,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2019-01-02 00:09:03,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 45 letters. Loop has 31 letters. [2019-01-02 00:09:03,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:03,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 76 letters. Loop has 31 letters. [2019-01-02 00:09:03,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:03,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 187 transitions. Stem has 45 letters. Loop has 62 letters. [2019-01-02 00:09:03,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:09:03,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 223 states and 330 transitions. [2019-01-02 00:09:03,739 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:03,740 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 223 states to 0 states and 0 transitions. [2019-01-02 00:09:03,740 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:03,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:03,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:03,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:03,740 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:03,740 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:03,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-02 00:09:03,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-02 00:09:03,744 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-01-02 00:09:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:09:03,744 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-02 00:09:03,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-02 00:09:03,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-02 00:09:03,744 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:03,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-02 00:09:03,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:09:03,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:09:03,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:09:03,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:09:03,745 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:03,745 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:03,745 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:09:03,745 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:09:03,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:09:03,746 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:09:03,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:09:03,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:09:03 BoogieIcfgContainer [2019-01-02 00:09:03,753 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:09:03,754 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:09:03,754 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:09:03,754 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:09:03,755 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:08:55" (3/4) ... [2019-01-02 00:09:03,759 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:09:03,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:09:03,761 INFO L168 Benchmark]: Toolchain (without parser) took 10551.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 306.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -145.4 MB). Peak memory consumption was 161.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:03,762 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:03,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.17 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:03,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:03,764 INFO L168 Benchmark]: Boogie Preprocessor took 80.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:03,766 INFO L168 Benchmark]: RCFGBuilder took 1326.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:03,768 INFO L168 Benchmark]: BuchiAutomizer took 8353.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.7 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2019-01-02 00:09:03,769 INFO L168 Benchmark]: Witness Printer took 5.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:09:03,775 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.17 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 924.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 163.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.86 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1326.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 57.4 MB). Peak memory consumption was 57.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8353.69 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 168.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.7 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.41 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 23 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.3s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.1s. Construction of modules took 0.3s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 134 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 606 SDtfs, 188 SDslu, 1118 SDs, 0 SdLazy, 22 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital347 mio100 ax121 hnf105 lsp16 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...