./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.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 a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 21:21:22,777 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 21:21:22,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 21:21:22,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 21:21:22,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 21:21:22,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 21:21:22,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 21:21:22,815 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 21:21:22,820 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 21:21:22,823 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 21:21:22,825 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 21:21:22,827 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 21:21:22,827 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 21:21:22,832 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 21:21:22,833 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 21:21:22,835 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 21:21:22,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 21:21:22,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 21:21:22,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 21:21:22,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 21:21:22,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 21:21:22,854 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 21:21:22,856 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 21:21:22,857 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 21:21:22,860 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 21:21:22,860 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 21:21:22,861 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 21:21:22,862 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 21:21:22,863 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 21:21:22,864 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 21:21:22,864 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 21:21:22,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 21:21:22,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 21:21:22,867 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 21:21:22,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 21:21:22,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 21:21:22,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 21:21:22,871 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 21:21:22,871 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 21:21:22,872 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 21:21:22,873 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 21:21:22,874 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 21:21:22,913 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 21:21:22,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 21:21:22,915 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 21:21:22,916 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 21:21:22,916 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 21:21:22,917 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 21:21:22,917 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 21:21:22,917 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 21:21:22,917 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 21:21:22,918 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 21:21:22,919 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 21:21:22,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 21:21:22,919 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 21:21:22,920 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 21:21:22,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 21:21:22,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 21:21:22,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 21:21:22,921 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 21:21:22,921 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 21:21:22,921 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 21:21:22,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 21:21:22,922 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 21:21:22,922 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 21:21:22,923 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 21:21:22,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 21:21:22,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 21:21:22,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 21:21:22,924 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 21:21:22,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 21:21:22,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 21:21:22,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 21:21:22,926 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 21:21:22,927 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 21:21:22,927 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> a90b25a4abf3a535ee7c4ba6368944b8e32b5ef5 [2019-11-28 21:21:23,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 21:21:23,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 21:21:23,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 21:21:23,261 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 21:21:23,262 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 21:21:23,262 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2019-11-28 21:21:23,345 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152c9b23d/01db20e21fe943ef9b75f8cfe15c07d0/FLAG020093580 [2019-11-28 21:21:23,866 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 21:21:23,867 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2019-11-28 21:21:23,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152c9b23d/01db20e21fe943ef9b75f8cfe15c07d0/FLAG020093580 [2019-11-28 21:21:24,168 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152c9b23d/01db20e21fe943ef9b75f8cfe15c07d0 [2019-11-28 21:21:24,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 21:21:24,174 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 21:21:24,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 21:21:24,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 21:21:24,183 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 21:21:24,184 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,187 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f4f4d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24, skipping insertion in model container [2019-11-28 21:21:24,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,196 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 21:21:24,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 21:21:24,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:21:24,508 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 21:21:24,606 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 21:21:24,627 INFO L208 MainTranslator]: Completed translation [2019-11-28 21:21:24,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24 WrapperNode [2019-11-28 21:21:24,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 21:21:24,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 21:21:24,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 21:21:24,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 21:21:24,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,661 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 21:21:24,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 21:21:24,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 21:21:24,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 21:21:24,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,737 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,768 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (1/1) ... [2019-11-28 21:21:24,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 21:21:24,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 21:21:24,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 21:21:24,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 21:21:24,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (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-11-28 21:21:24,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 21:21:24,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 21:21:25,346 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 21:21:25,346 INFO L287 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-28 21:21:25,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:25 BoogieIcfgContainer [2019-11-28 21:21:25,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 21:21:25,348 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 21:21:25,349 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 21:21:25,353 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 21:21:25,354 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:25,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 09:21:24" (1/3) ... [2019-11-28 21:21:25,355 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ee75e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:21:25, skipping insertion in model container [2019-11-28 21:21:25,356 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:25,356 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 09:21:24" (2/3) ... [2019-11-28 21:21:25,356 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@ee75e0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 09:21:25, skipping insertion in model container [2019-11-28 21:21:25,357 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 21:21:25,357 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:25" (3/3) ... [2019-11-28 21:21:25,359 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2019-11-28 21:21:25,413 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 21:21:25,413 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 21:21:25,415 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 21:21:25,416 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 21:21:25,416 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 21:21:25,416 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 21:21:25,416 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 21:21:25,417 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 21:21:25,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2019-11-28 21:21:25,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 21:21:25,460 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:25,460 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:25,467 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:21:25,468 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:25,468 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 21:21:25,468 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 59 states. [2019-11-28 21:21:25,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2019-11-28 21:21:25,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:25,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:25,474 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-28 21:21:25,475 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:25,481 INFO L794 eck$LassoCheckResult]: Stem: 34#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 13#L-1true havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 3#L175true assume !(0 == ~r1~0);init_~tmp~0 := 0; 21#L175-1true init_#res := init_~tmp~0; 53#L240true main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 33#L300-2true [2019-11-28 21:21:25,482 INFO L796 eck$LassoCheckResult]: Loop: 33#L300-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 40#L99true assume !(0 != ~mode1~0 % 256); 6#L113true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 4#L113-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 37#L99-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 29#L125true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 35#L128true assume !(node2_~m2~0 != ~nomsg~0); 32#L128-1true ~mode2~0 := 0; 25#L125-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 36#L150true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 22#L153true assume !(node3_~m3~0 != ~nomsg~0); 18#L153-1true ~mode3~0 := 0; 12#L150-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 19#L248true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 17#L248-1true check_#res := check_~tmp~1; 50#L268true main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 52#L324true assume !(0 == assert_~arg % 256); 46#L319true main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 33#L300-2true [2019-11-28 21:21:25,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:25,488 INFO L82 PathProgramCache]: Analyzing trace with hash 28785120, now seen corresponding path program 1 times [2019-11-28 21:21:25,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:25,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436306693] [2019-11-28 21:21:25,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:25,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436306693] [2019-11-28 21:21:25,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:25,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:25,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337182451] [2019-11-28 21:21:25,714 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 21:21:25,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:25,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2127129926, now seen corresponding path program 1 times [2019-11-28 21:21:25,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:25,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771506224] [2019-11-28 21:21:25,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:25,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:25,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771506224] [2019-11-28 21:21:25,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:25,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:21:25,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948041579] [2019-11-28 21:21:25,875 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:25,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 21:21:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 21:21:25,896 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 4 states. [2019-11-28 21:21:25,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:25,998 INFO L93 Difference]: Finished difference Result 61 states and 96 transitions. [2019-11-28 21:21:25,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 21:21:26,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 96 transitions. [2019-11-28 21:21:26,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2019-11-28 21:21:26,025 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 54 states and 74 transitions. [2019-11-28 21:21:26,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 21:21:26,029 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 21:21:26,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 74 transitions. [2019-11-28 21:21:26,031 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:26,032 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2019-11-28 21:21:26,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 74 transitions. [2019-11-28 21:21:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 21:21:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 21:21:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 74 transitions. [2019-11-28 21:21:26,076 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2019-11-28 21:21:26,076 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 74 transitions. [2019-11-28 21:21:26,076 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 21:21:26,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 74 transitions. [2019-11-28 21:21:26,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2019-11-28 21:21:26,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:26,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:26,080 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:26,080 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:26,081 INFO L794 eck$LassoCheckResult]: Stem: 177#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 153#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 135#L175 assume 0 == ~r1~0; 136#L176 assume ~id1~0 >= 0; 163#L177 assume 0 == ~st1~0; 182#L178 assume ~send1~0 == ~id1~0; 147#L179 assume 0 == ~mode1~0 % 256; 148#L180 assume ~id2~0 >= 0; 173#L181 assume 0 == ~st2~0; 156#L182 assume ~send2~0 == ~id2~0; 157#L183 assume 0 == ~mode2~0 % 256; 180#L184 assume ~id3~0 >= 0; 187#L185 assume 0 == ~st3~0; 139#L186 assume ~send3~0 == ~id3~0; 140#L187 assume 0 == ~mode3~0 % 256; 164#L188 assume ~id1~0 != ~id2~0; 183#L189 assume ~id1~0 != ~id3~0; 149#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 150#L175-1 init_#res := init_~tmp~0; 160#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 175#L300-2 [2019-11-28 21:21:26,081 INFO L796 eck$LassoCheckResult]: Loop: 175#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 176#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 168#L103 assume !(node1_~m1~0 != ~nomsg~0); 167#L103-1 ~mode1~0 := 0; 138#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 171#L125 assume !(0 != ~mode2~0 % 256); 154#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 155#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 165#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 166#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 161#L153 assume !(node3_~m3~0 != ~nomsg~0); 146#L153-1 ~mode3~0 := 0; 151#L150-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 152#L248 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 143#L248-1 check_#res := check_~tmp~1; 158#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 186#L324 assume !(0 == assert_~arg % 256); 185#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 175#L300-2 [2019-11-28 21:21:26,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 1 times [2019-11-28 21:21:26,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777683037] [2019-11-28 21:21:26,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,194 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:26,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,194 INFO L82 PathProgramCache]: Analyzing trace with hash -235759546, now seen corresponding path program 1 times [2019-11-28 21:21:26,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708943515] [2019-11-28 21:21:26,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:26,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:26,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708943515] [2019-11-28 21:21:26,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:26,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 21:21:26,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086721528] [2019-11-28 21:21:26,322 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:26,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:26,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 21:21:26,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 21:21:26,324 INFO L87 Difference]: Start difference. First operand 54 states and 74 transitions. cyclomatic complexity: 21 Second operand 5 states. [2019-11-28 21:21:26,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:26,413 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2019-11-28 21:21:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 21:21:26,416 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 76 transitions. [2019-11-28 21:21:26,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2019-11-28 21:21:26,426 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 54 states and 71 transitions. [2019-11-28 21:21:26,426 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2019-11-28 21:21:26,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2019-11-28 21:21:26,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 71 transitions. [2019-11-28 21:21:26,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:26,429 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-11-28 21:21:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 71 transitions. [2019-11-28 21:21:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-28 21:21:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-28 21:21:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 71 transitions. [2019-11-28 21:21:26,440 INFO L711 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-11-28 21:21:26,440 INFO L591 BuchiCegarLoop]: Abstraction has 54 states and 71 transitions. [2019-11-28 21:21:26,440 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 21:21:26,441 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 71 transitions. [2019-11-28 21:21:26,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2019-11-28 21:21:26,443 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:26,443 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:26,444 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:26,446 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:26,446 INFO L794 eck$LassoCheckResult]: Stem: 300#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 275#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 258#L175 assume 0 == ~r1~0; 259#L176 assume ~id1~0 >= 0; 286#L177 assume 0 == ~st1~0; 305#L178 assume ~send1~0 == ~id1~0; 269#L179 assume 0 == ~mode1~0 % 256; 270#L180 assume ~id2~0 >= 0; 296#L181 assume 0 == ~st2~0; 278#L182 assume ~send2~0 == ~id2~0; 279#L183 assume 0 == ~mode2~0 % 256; 303#L184 assume ~id3~0 >= 0; 310#L185 assume 0 == ~st3~0; 262#L186 assume ~send3~0 == ~id3~0; 263#L187 assume 0 == ~mode3~0 % 256; 287#L188 assume ~id1~0 != ~id2~0; 306#L189 assume ~id1~0 != ~id3~0; 271#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 272#L175-1 init_#res := init_~tmp~0; 283#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 298#L300-2 [2019-11-28 21:21:26,446 INFO L796 eck$LassoCheckResult]: Loop: 298#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 299#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 291#L103 assume !(node1_~m1~0 != ~nomsg~0); 290#L103-1 ~mode1~0 := 0; 261#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 293#L125 assume !(0 != ~mode2~0 % 256); 276#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 277#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 288#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 289#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 284#L153 assume !(node3_~m3~0 != ~nomsg~0); 268#L153-1 ~mode3~0 := 0; 273#L150-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 274#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 282#L249 assume ~r1~0 >= 3; 266#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 280#L248-1 check_#res := check_~tmp~1; 281#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 309#L324 assume !(0 == assert_~arg % 256); 308#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 298#L300-2 [2019-11-28 21:21:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 2 times [2019-11-28 21:21:26,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86292534] [2019-11-28 21:21:26,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,533 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:26,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,534 INFO L82 PathProgramCache]: Analyzing trace with hash -347480874, now seen corresponding path program 1 times [2019-11-28 21:21:26,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667278315] [2019-11-28 21:21:26,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:26,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:26,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667278315] [2019-11-28 21:21:26,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:26,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:26,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41162569] [2019-11-28 21:21:26,576 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 21:21:26,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:26,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:21:26,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:21:26,577 INFO L87 Difference]: Start difference. First operand 54 states and 71 transitions. cyclomatic complexity: 18 Second operand 3 states. [2019-11-28 21:21:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:26,607 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-28 21:21:26,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 21:21:26,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 82 states and 111 transitions. [2019-11-28 21:21:26,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-11-28 21:21:26,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 82 states to 82 states and 111 transitions. [2019-11-28 21:21:26,611 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2019-11-28 21:21:26,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 82 [2019-11-28 21:21:26,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 111 transitions. [2019-11-28 21:21:26,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:26,613 INFO L688 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2019-11-28 21:21:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states and 111 transitions. [2019-11-28 21:21:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-28 21:21:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-28 21:21:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 111 transitions. [2019-11-28 21:21:26,620 INFO L711 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2019-11-28 21:21:26,620 INFO L591 BuchiCegarLoop]: Abstraction has 82 states and 111 transitions. [2019-11-28 21:21:26,620 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 21:21:26,621 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 82 states and 111 transitions. [2019-11-28 21:21:26,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2019-11-28 21:21:26,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 21:21:26,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 21:21:26,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 21:21:26,623 INFO L850 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] [2019-11-28 21:21:26,624 INFO L794 eck$LassoCheckResult]: Stem: 444#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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~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;~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]; 417#L-1 havoc main_#res;havoc main_#t~nondet3, main_#t~nondet4, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~ret16, main_#t~ret17, main_#t~post18, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet3;havoc main_#t~nondet3;~id1~0 := main_#t~nondet4;havoc main_#t~nondet4;~st1~0 := main_#t~nondet5;havoc main_#t~nondet5;~send1~0 := main_#t~nondet6;havoc main_#t~nondet6;~mode1~0 := main_#t~nondet7;havoc main_#t~nondet7;~id2~0 := main_#t~nondet8;havoc main_#t~nondet8;~st2~0 := main_#t~nondet9;havoc main_#t~nondet9;~send2~0 := main_#t~nondet10;havoc main_#t~nondet10;~mode2~0 := main_#t~nondet11;havoc main_#t~nondet11;~id3~0 := main_#t~nondet12;havoc main_#t~nondet12;~st3~0 := main_#t~nondet13;havoc main_#t~nondet13;~send3~0 := main_#t~nondet14;havoc main_#t~nondet14;~mode3~0 := main_#t~nondet15;havoc main_#t~nondet15;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 400#L175 assume 0 == ~r1~0; 401#L176 assume ~id1~0 >= 0; 428#L177 assume 0 == ~st1~0; 451#L178 assume ~send1~0 == ~id1~0; 411#L179 assume 0 == ~mode1~0 % 256; 412#L180 assume ~id2~0 >= 0; 440#L181 assume 0 == ~st2~0; 420#L182 assume ~send2~0 == ~id2~0; 421#L183 assume 0 == ~mode2~0 % 256; 448#L184 assume ~id3~0 >= 0; 456#L185 assume 0 == ~st3~0; 404#L186 assume ~send3~0 == ~id3~0; 405#L187 assume 0 == ~mode3~0 % 256; 431#L188 assume ~id1~0 != ~id2~0; 452#L189 assume ~id1~0 != ~id3~0; 413#L190 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 414#L175-1 init_#res := init_~tmp~0; 425#L240 main_#t~ret16 := init_#res;main_~i2~0 := main_#t~ret16;havoc main_#t~ret16;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;main_~i2~0 := 0; 457#L300-2 [2019-11-28 21:21:26,624 INFO L796 eck$LassoCheckResult]: Loop: 457#L300-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 477#L99 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 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 434#L103 assume !(node1_~m1~0 != ~nomsg~0); 432#L103-1 ~mode1~0 := 0; 433#L99-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 474#L125 assume !(0 != ~mode2~0 % 256); 470#L138 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 469#L138-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 467#L125-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 446#L150 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 426#L153 assume !(node3_~m3~0 != ~nomsg~0); 410#L153-1 ~mode3~0 := 0; 415#L150-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 416#L248 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 424#L249 assume !(~r1~0 >= 3); 407#L252 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 408#L253 assume ~r1~0 < 3;check_~tmp~1 := 1; 481#L248-1 check_#res := check_~tmp~1; 480#L268 main_#t~ret17 := check_#res;main_~c1~0 := main_#t~ret17;havoc main_#t~ret17;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 479#L324 assume !(0 == assert_~arg % 256); 478#L319 main_#t~post18 := main_~i2~0;main_~i2~0 := 1 + main_#t~post18;havoc main_#t~post18; 457#L300-2 [2019-11-28 21:21:26,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1664101251, now seen corresponding path program 3 times [2019-11-28 21:21:26,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421151360] [2019-11-28 21:21:26,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,688 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,690 INFO L82 PathProgramCache]: Analyzing trace with hash -535400680, now seen corresponding path program 1 times [2019-11-28 21:21:26,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955674673] [2019-11-28 21:21:26,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 21:21:26,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 21:21:26,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:26,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1845919716, now seen corresponding path program 1 times [2019-11-28 21:21:26,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 21:21:26,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183786410] [2019-11-28 21:21:26,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 21:21:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:26,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:26,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183786410] [2019-11-28 21:21:26,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 21:21:26,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 21:21:26,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399279740] [2019-11-28 21:21:27,149 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 103 [2019-11-28 21:21:28,346 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-11-28 21:21:28,361 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:21:28,362 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:21:28,362 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:21:28,362 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:21:28,362 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-11-28 21:21:28,363 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:28,363 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:21:28,363 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:21:28,363 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-11-28 21:21:28,363 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:21:28,363 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:21:28,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,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-11-28 21:21:28,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:28,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:29,853 WARN L192 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-28 21:21:30,017 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:21:30,018 INFO L404 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) [2019-11-28 21:21:30,027 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-28 21:21:30,027 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2019-11-28 21:21:30,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-28 21:21:30,060 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:30,153 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-28 21:21:30,155 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 21:21:30,156 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 21:21:30,156 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 21:21:30,156 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 21:21:30,156 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 21:21:30,156 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:30,156 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 21:21:30,156 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 21:21:30,156 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2019-11-28 21:21:30,157 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 21:21:30,157 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 21:21:30,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-11-28 21:21:30,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,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-11-28 21:21:30,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 21:21:30,592 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-28 21:21:31,651 WARN L192 SmtUtils]: Spent 896.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-28 21:21:31,782 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 21:21:31,787 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:31,797 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:21:31,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:31,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:31,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:31,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:31,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:31,802 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:31,802 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:31,804 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:31,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:21:31,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:31,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:31,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:31,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:31,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:31,814 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:31,814 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:31,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:31,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 21:21:31,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 21:21:31,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 21:21:31,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 21:21:31,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 21:21:31,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 21:21:31,832 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 21:21:31,832 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 21:21:31,835 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 21:21:31,845 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-28 21:21:31,845 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 21:21:31,853 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 21:21:31,853 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-28 21:21:31,854 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 21:21:31,854 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2019-11-28 21:21:31,860 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 21:21:31,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 21:21:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:31,971 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 21:21:31,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:21:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 21:21:32,020 INFO L264 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 21:21:32,021 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 21:21:32,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 21:21:32,058 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-11-28 21:21:32,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 82 states and 111 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-11-28 21:21:32,117 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 82 states and 111 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 143 states and 202 transitions. Complement of second has 4 states. [2019-11-28 21:21:32,119 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-11-28 21:21:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 21:21:32,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2019-11-28 21:21:32,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 20 letters. Loop has 21 letters. [2019-11-28 21:21:32,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:32,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 41 letters. Loop has 21 letters. [2019-11-28 21:21:32,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:32,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 71 transitions. Stem has 20 letters. Loop has 42 letters. [2019-11-28 21:21:32,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 21:21:32,132 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 143 states and 202 transitions. [2019-11-28 21:21:32,135 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:32,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 143 states to 0 states and 0 transitions. [2019-11-28 21:21:32,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:21:32,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:21:32,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:21:32,142 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:32,142 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:32,142 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:32,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 21:21:32,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 21:21:32,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 21:21:32,143 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-11-28 21:21:32,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 21:21:32,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-28 21:21:32,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 21:21:32,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-28 21:21:32,145 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:32,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 21:21:32,145 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 21:21:32,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 21:21:32,146 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 21:21:32,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 21:21:32,146 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:32,146 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:32,147 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 21:21:32,147 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 21:21:32,147 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 21:21:32,147 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 21:21:32,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 21:21:32,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 09:21:32 BoogieIcfgContainer [2019-11-28 21:21:32,155 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 21:21:32,156 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 21:21:32,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 21:21:32,157 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 21:21:32,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 09:21:25" (3/4) ... [2019-11-28 21:21:32,162 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 21:21:32,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 21:21:32,167 INFO L168 Benchmark]: Toolchain (without parser) took 7992.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 297.3 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -129.3 MB). Peak memory consumption was 167.9 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:32,168 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:32,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 449.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:32,173 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:32,174 INFO L168 Benchmark]: Boogie Preprocessor took 69.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 21:21:32,174 INFO L168 Benchmark]: RCFGBuilder took 565.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:32,175 INFO L168 Benchmark]: BuchiAutomizer took 6806.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.5 MB). Peak memory consumption was 162.7 MB. Max. memory is 11.5 GB. [2019-11-28 21:21:32,176 INFO L168 Benchmark]: Witness Printer took 7.98 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-11-28 21:21:32,179 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 449.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -139.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.99 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 565.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6806.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -24.5 MB). Peak memory consumption was 162.7 MB. Max. memory is 11.5 GB. * Witness Printer took 7.98 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 6.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 82 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 338 SDtfs, 161 SDslu, 488 SDs, 0 SdLazy, 32 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital474 mio100 ax107 hnf101 lsp16 ukn72 mio100 lsp100 div149 bol100 ite100 ukn100 eq178 hnf72 smp100 dnf670 smp48 tf100 neg99 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 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...