./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version ae007674 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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-var-start-time.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 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 09:48:51,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 09:48:51,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 09:48:51,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 09:48:51,602 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 09:48:51,603 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 09:48:51,604 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 09:48:51,605 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 09:48:51,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 09:48:51,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 09:48:51,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 09:48:51,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 09:48:51,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 09:48:51,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 09:48:51,614 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 09:48:51,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 09:48:51,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 09:48:51,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 09:48:51,619 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 09:48:51,620 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 09:48:51,621 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 09:48:51,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 09:48:51,624 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 09:48:51,625 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 09:48:51,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 09:48:51,630 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 09:48:51,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 09:48:51,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 09:48:51,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 09:48:51,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 09:48:51,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 09:48:51,636 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 09:48:51,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 09:48:51,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 09:48:51,640 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 09:48:51,641 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 09:48:51,641 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 09:48:51,642 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 09:48:51,642 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 09:48:51,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 09:48:51,644 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 09:48:51,645 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-28 09:48:51,667 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 09:48:51,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 09:48:51,667 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 09:48:51,667 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 09:48:51,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 09:48:51,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 09:48:51,669 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 09:48:51,669 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-28 09:48:51,669 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-28 09:48:51,669 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-28 09:48:51,669 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-28 09:48:51,669 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-28 09:48:51,669 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-28 09:48:51,670 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-28 09:48:51,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-28 09:48:51,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-28 09:48:51,671 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 09:48:51,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 09:48:51,671 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-28 09:48:51,671 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 09:48:51,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-28 09:48:51,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 09:48:51,673 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 09:48:51,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 09:48:51,673 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 09:48:51,674 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-28 09:48:51,674 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 76982ccfa15d5420010caf48ff31900a394710bc42d46403e291e5b0b2cbfb5b [2021-12-28 09:48:51,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 09:48:51,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 09:48:51,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 09:48:51,929 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 09:48:51,930 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 09:48:51,931 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2021-12-28 09:48:51,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159aa2502/643a36b8187249d2a0c424581c85a02e/FLAGb635befb0 [2021-12-28 09:48:52,352 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 09:48:52,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2021-12-28 09:48:52,362 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159aa2502/643a36b8187249d2a0c424581c85a02e/FLAGb635befb0 [2021-12-28 09:48:52,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159aa2502/643a36b8187249d2a0c424581c85a02e [2021-12-28 09:48:52,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 09:48:52,764 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 09:48:52,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 09:48:52,765 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 09:48:52,767 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 09:48:52,768 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:48:52" (1/1) ... [2021-12-28 09:48:52,768 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@722dd13c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:52, skipping insertion in model container [2021-12-28 09:48:52,769 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 09:48:52" (1/1) ... [2021-12-28 09:48:52,773 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 09:48:52,801 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 09:48:52,925 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2021-12-28 09:48:52,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:48:52,936 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 09:48:53,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c[6803,6816] [2021-12-28 09:48:53,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 09:48:53,032 INFO L208 MainTranslator]: Completed translation [2021-12-28 09:48:53,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53 WrapperNode [2021-12-28 09:48:53,033 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 09:48:53,034 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 09:48:53,034 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 09:48:53,034 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 09:48:53,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,056 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,086 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2021-12-28 09:48:53,087 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 09:48:53,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 09:48:53,088 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 09:48:53,088 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 09:48:53,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,122 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 09:48:53,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 09:48:53,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 09:48:53,125 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 09:48:53,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (1/1) ... [2021-12-28 09:48:53,135 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:53,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:53,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:53,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-28 09:48:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 09:48:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 09:48:53,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 09:48:53,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 09:48:53,266 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 09:48:53,267 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 09:48:53,500 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 09:48:53,505 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 09:48:53,505 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-28 09:48:53,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:48:53 BoogieIcfgContainer [2021-12-28 09:48:53,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 09:48:53,507 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-28 09:48:53,507 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-28 09:48:53,509 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-28 09:48:53,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:48:53,510 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.12 09:48:52" (1/3) ... [2021-12-28 09:48:53,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c35776e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:48:53, skipping insertion in model container [2021-12-28 09:48:53,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:48:53,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 09:48:53" (2/3) ... [2021-12-28 09:48:53,511 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c35776e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.12 09:48:53, skipping insertion in model container [2021-12-28 09:48:53,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-28 09:48:53,511 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:48:53" (3/3) ... [2021-12-28 09:48:53,512 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c [2021-12-28 09:48:53,539 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-28 09:48:53,539 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-28 09:48:53,539 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-28 09:48:53,539 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-28 09:48:53,540 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-28 09:48:53,540 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-28 09:48:53,540 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-28 09:48:53,540 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-28 09:48:53,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:53,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-28 09:48:53,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:48:53,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:48:53,571 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:53,571 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:53,571 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-28 09:48:53,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:53,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2021-12-28 09:48:53,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:48:53,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:48:53,576 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:53,576 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:53,580 INFO L791 eck$LassoCheckResult]: Stem: 56#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 38#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 12#L159true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 37#L159-1true init_#res#1 := init_~tmp~0#1; 22#L228true main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 40#L275true assume 0 == main_~i2~0#1;assume false; 54#L275-2true ~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#1 := 0; 17#L283-2true [2021-12-28 09:48:53,581 INFO L793 eck$LassoCheckResult]: Loop: 17#L283-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 76#L57true 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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 6#L61true assume !(node1_~m1~0#1 != ~nomsg~0); 45#L61-1true ~mode1~0 := 0; 62#L57-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 46#L92true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 25#L95true assume !(node2_~m2~0#1 != ~nomsg~0); 32#L95-1true ~mode2~0 := 0; 72#L92-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 5#L126true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 51#L129true assume !(node3_~m3~0#1 != ~nomsg~0); 43#L129-1true ~mode3~0 := 0; 73#L126-2true assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 70#L236true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 74#L236-1true check_#res#1 := check_~tmp~1#1; 75#L248true main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 14#L307true assume !(0 == assert_~arg#1 % 256); 18#L302true assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 17#L283-2true [2021-12-28 09:48:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425706, now seen corresponding path program 1 times [2021-12-28 09:48:53,590 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:53,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517979400] [2021-12-28 09:48:53,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:53,591 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:53,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:48:53,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517979400] [2021-12-28 09:48:53,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517979400] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:48:53,710 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:48:53,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-28 09:48:53,711 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307407475] [2021-12-28 09:48:53,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:48:53,714 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:48:53,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:53,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 1 times [2021-12-28 09:48:53,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:53,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890566799] [2021-12-28 09:48:53,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:53,715 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:53,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:48:53,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890566799] [2021-12-28 09:48:53,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890566799] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:48:53,857 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:48:53,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:48:53,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426367106] [2021-12-28 09:48:53,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:48:53,858 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:48:53,859 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:48:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-28 09:48:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-28 09:48:53,885 INFO L87 Difference]: Start difference. First operand has 78 states, 77 states have (on average 1.6623376623376624) internal successors, (128), 77 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:53,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:48:53,905 INFO L93 Difference]: Finished difference Result 78 states and 125 transitions. [2021-12-28 09:48:53,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 09:48:53,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 125 transitions. [2021-12-28 09:48:53,920 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-28 09:48:53,925 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 73 states and 120 transitions. [2021-12-28 09:48:53,926 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-28 09:48:53,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-28 09:48:53,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 120 transitions. [2021-12-28 09:48:53,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:48:53,929 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-12-28 09:48:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 120 transitions. [2021-12-28 09:48:53,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-28 09:48:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.643835616438356) internal successors, (120), 72 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 120 transitions. [2021-12-28 09:48:53,958 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-12-28 09:48:53,958 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 120 transitions. [2021-12-28 09:48:53,959 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-28 09:48:53,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 120 transitions. [2021-12-28 09:48:53,964 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-28 09:48:53,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:48:53,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:48:53,965 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:53,965 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:53,965 INFO L791 eck$LassoCheckResult]: Stem: 232#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 215#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 187#L159 assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 173#L159-1 init_#res#1 := init_~tmp~0#1; 199#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 200#L275 assume !(0 == main_~i2~0#1); 219#L275-2 ~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#1 := 0; 195#L283-2 [2021-12-28 09:48:53,966 INFO L793 eck$LassoCheckResult]: Loop: 195#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 196#L57 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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 174#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 176#L61-1 ~mode1~0 := 0; 227#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 228#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 204#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 184#L95-1 ~mode2~0 := 0; 211#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 169#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 170#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 221#L129-1 ~mode3~0 := 0; 222#L126-2 assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 236#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 210#L236-1 check_#res#1 := check_~tmp~1#1; 239#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 189#L307 assume !(0 == assert_~arg#1 % 256); 190#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 195#L283-2 [2021-12-28 09:48:53,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:53,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1898425768, now seen corresponding path program 1 times [2021-12-28 09:48:53,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:53,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371598633] [2021-12-28 09:48:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:53,968 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:54,039 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:48:54,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371598633] [2021-12-28 09:48:54,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371598633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:48:54,039 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:48:54,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:48:54,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489704218] [2021-12-28 09:48:54,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:48:54,040 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-28 09:48:54,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:54,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 2 times [2021-12-28 09:48:54,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:54,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653620040] [2021-12-28 09:48:54,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:54,040 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:54,132 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:48:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653620040] [2021-12-28 09:48:54,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653620040] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:48:54,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:48:54,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:48:54,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696671057] [2021-12-28 09:48:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:48:54,134 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:48:54,135 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:48:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:48:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:48:54,135 INFO L87 Difference]: Start difference. First operand 73 states and 120 transitions. cyclomatic complexity: 48 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:54,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:48:54,205 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2021-12-28 09:48:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-28 09:48:54,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 126 states and 202 transitions. [2021-12-28 09:48:54,209 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-28 09:48:54,211 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 126 states to 123 states and 183 transitions. [2021-12-28 09:48:54,212 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2021-12-28 09:48:54,213 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 123 [2021-12-28 09:48:54,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 183 transitions. [2021-12-28 09:48:54,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:48:54,214 INFO L681 BuchiCegarLoop]: Abstraction has 123 states and 183 transitions. [2021-12-28 09:48:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states and 183 transitions. [2021-12-28 09:48:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 73. [2021-12-28 09:48:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 72 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:54,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 103 transitions. [2021-12-28 09:48:54,220 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-12-28 09:48:54,220 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 103 transitions. [2021-12-28 09:48:54,220 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-28 09:48:54,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 103 transitions. [2021-12-28 09:48:54,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-28 09:48:54,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:48:54,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:48:54,222 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:54,222 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:54,227 INFO L791 eck$LassoCheckResult]: Stem: 446#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 401#L159 assume 0 == ~r1~0; 402#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 407#L161 assume ~id1~0 >= 0; 408#L162 assume 0 == ~st1~0; 426#L163 assume ~send1~0 == ~id1~0; 411#L164 assume 0 == ~mode1~0 % 256; 405#L165 assume ~id2~0 >= 0; 406#L166 assume 0 == ~st2~0; 415#L167 assume ~send2~0 == ~id2~0; 395#L168 assume 0 == ~mode2~0 % 256; 396#L169 assume ~id3~0 >= 0; 449#L170 assume 0 == ~st3~0; 434#L171 assume ~send3~0 == ~id3~0; 430#L172 assume 0 == ~mode3~0 % 256; 431#L173 assume ~id1~0 != ~id2~0; 448#L174 assume ~id1~0 != ~id3~0; 386#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 387#L159-1 init_#res#1 := init_~tmp~0#1; 413#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 414#L275 assume !(0 == main_~i2~0#1); 432#L275-2 ~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#1 := 0; 409#L283-2 [2021-12-28 09:48:54,227 INFO L793 eck$LassoCheckResult]: Loop: 409#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 410#L57 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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 388#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 390#L61-1 ~mode1~0 := 0; 439#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 440#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 418#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 398#L95-1 ~mode2~0 := 0; 425#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 383#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 384#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 435#L129-1 ~mode3~0 := 0; 436#L126-2 assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 452#L236 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 424#L236-1 check_#res#1 := check_~tmp~1#1; 453#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 403#L307 assume !(0 == assert_~arg#1 % 256); 404#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 409#L283-2 [2021-12-28 09:48:54,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:54,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 1 times [2021-12-28 09:48:54,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:54,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243336067] [2021-12-28 09:48:54,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:54,229 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:48:54,251 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:48:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:48:54,290 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:48:54,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:54,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1437480316, now seen corresponding path program 3 times [2021-12-28 09:48:54,291 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:54,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672589738] [2021-12-28 09:48:54,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:54,292 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:54,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:54,390 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:48:54,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672589738] [2021-12-28 09:48:54,391 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672589738] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:48:54,391 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:48:54,391 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 09:48:54,391 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697712159] [2021-12-28 09:48:54,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:48:54,392 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-28 09:48:54,392 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:48:54,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 09:48:54,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 09:48:54,393 INFO L87 Difference]: Start difference. First operand 73 states and 103 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:48:54,428 INFO L93 Difference]: Finished difference Result 76 states and 105 transitions. [2021-12-28 09:48:54,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 09:48:54,430 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 105 transitions. [2021-12-28 09:48:54,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-28 09:48:54,433 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 73 states and 101 transitions. [2021-12-28 09:48:54,433 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 73 [2021-12-28 09:48:54,434 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 73 [2021-12-28 09:48:54,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 73 states and 101 transitions. [2021-12-28 09:48:54,437 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:48:54,437 INFO L681 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-12-28 09:48:54,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states and 101 transitions. [2021-12-28 09:48:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2021-12-28 09:48:54,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 72 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2021-12-28 09:48:54,447 INFO L704 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-12-28 09:48:54,447 INFO L587 BuchiCegarLoop]: Abstraction has 73 states and 101 transitions. [2021-12-28 09:48:54,447 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-28 09:48:54,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 73 states and 101 transitions. [2021-12-28 09:48:54,447 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2021-12-28 09:48:54,447 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-28 09:48:54,447 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-28 09:48:54,448 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:54,448 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 09:48:54,448 INFO L791 eck$LassoCheckResult]: Stem: 607#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(47, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~alive1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~alive2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~alive3~0 := 0; 590#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~ret26#1, main_#t~ret27#1, main_#t~post28#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~id1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~alive1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~alive2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send3~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~alive3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 562#L159 assume 0 == ~r1~0; 563#L160 assume ~alive1~0 % 256 + ~alive2~0 % 256 + ~alive3~0 % 256 >= 1; 568#L161 assume ~id1~0 >= 0; 569#L162 assume 0 == ~st1~0; 587#L163 assume ~send1~0 == ~id1~0; 573#L164 assume 0 == ~mode1~0 % 256; 566#L165 assume ~id2~0 >= 0; 567#L166 assume 0 == ~st2~0; 578#L167 assume ~send2~0 == ~id2~0; 556#L168 assume 0 == ~mode2~0 % 256; 557#L169 assume ~id3~0 >= 0; 610#L170 assume 0 == ~st3~0; 595#L171 assume ~send3~0 == ~id3~0; 591#L172 assume 0 == ~mode3~0 % 256; 592#L173 assume ~id1~0 != ~id2~0; 609#L174 assume ~id1~0 != ~id3~0; 547#L175 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 548#L159-1 init_#res#1 := init_~tmp~0#1; 574#L228 main_#t~ret26#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret26#1;havoc main_#t~ret26#1; 575#L275 assume !(0 == main_~i2~0#1); 593#L275-2 ~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#1 := 0; 570#L283-2 [2021-12-28 09:48:54,448 INFO L793 eck$LassoCheckResult]: Loop: 570#L283-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 571#L57 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#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 549#L61 assume !(node1_~m1~0#1 != ~nomsg~0); 551#L61-1 ~mode1~0 := 0; 602#L57-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 603#L92 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 579#L95 assume !(node2_~m2~0#1 != ~nomsg~0); 559#L95-1 ~mode2~0 := 0; 586#L92-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 544#L126 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 545#L129 assume !(node3_~m3~0#1 != ~nomsg~0); 596#L129-1 ~mode3~0 := 0; 597#L126-2 assume { :end_inline_node3 } true;~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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 611#L236 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 588#L237 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 585#L236-1 check_#res#1 := check_~tmp~1#1; 614#L248 main_#t~ret27#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret27#1;havoc main_#t~ret27#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 564#L307 assume !(0 == assert_~arg#1 % 256); 565#L302 assume { :end_inline_assert } true;main_#t~post28#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post28#1;havoc main_#t~post28#1; 570#L283-2 [2021-12-28 09:48:54,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:54,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1524872798, now seen corresponding path program 2 times [2021-12-28 09:48:54,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:54,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567728971] [2021-12-28 09:48:54,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:54,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:48:54,460 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:48:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:48:54,476 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:48:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1995544096, now seen corresponding path program 1 times [2021-12-28 09:48:54,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:54,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152891439] [2021-12-28 09:48:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:54,477 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:48:54,485 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 09:48:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 09:48:54,493 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 09:48:54,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash 964547683, now seen corresponding path program 1 times [2021-12-28 09:48:54,493 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 09:48:54,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649613847] [2021-12-28 09:48:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 09:48:54,494 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 09:48:54,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:54,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 09:48:54,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649613847] [2021-12-28 09:48:54,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649613847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 09:48:54,526 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 09:48:54,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-28 09:48:54,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109056833] [2021-12-28 09:48:54,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 09:48:54,958 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:48:54,959 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:48:54,959 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:48:54,959 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:48:54,959 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-28 09:48:54,959 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:54,968 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:48:54,968 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:48:54,968 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-28 09:48:54,968 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:48:54,968 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:48:54,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:54,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:54,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:54,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:54,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,009 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,356 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:48:55,357 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-28 09:48:55,358 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:55,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:55,360 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:55,366 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-28 09:48:55,366 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:48:55,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-12-28 09:48:55,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2021-12-28 09:48:55,398 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:55,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:55,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:55,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-12-28 09:48:55,402 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-28 09:48:55,402 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-28 09:48:55,558 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-28 09:48:55,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-12-28 09:48:55,565 INFO L210 LassoAnalysis]: Preferences: [2021-12-28 09:48:55,565 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-28 09:48:55,565 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-28 09:48:55,566 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-28 09:48:55,566 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-28 09:48:55,566 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:55,566 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-28 09:48:55,566 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-28 09:48:55,566 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr-var-start-time.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-28 09:48:55,566 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-28 09:48:55,566 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-28 09:48:55,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-12-28 09:48:55,957 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-28 09:48:55,960 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-28 09:48:55,961 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:55,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:55,962 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:55,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-12-28 09:48:55,964 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:48:55,971 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:48:55,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:48:55,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:48:55,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:48:55,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:48:55,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:48:55,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:48:55,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:48:56,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-12-28 09:48:56,005 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:56,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:56,006 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:56,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-12-28 09:48:56,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:48:56,014 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:48:56,014 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:48:56,014 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:48:56,014 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:48:56,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:48:56,015 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:48:56,016 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:48:56,025 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:48:56,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-12-28 09:48:56,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:56,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:56,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-12-28 09:48:56,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:48:56,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:48:56,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:48:56,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:48:56,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:48:56,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:48:56,053 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:48:56,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:48:56,057 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-28 09:48:56,078 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2021-12-28 09:48:56,079 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:56,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:56,080 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:56,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-12-28 09:48:56,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-12-28 09:48:56,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-28 09:48:56,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-28 09:48:56,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-28 09:48:56,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-28 09:48:56,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-28 09:48:56,103 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-28 09:48:56,104 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-28 09:48:56,118 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-28 09:48:56,122 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-28 09:48:56,122 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-28 09:48:56,123 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-28 09:48:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 09:48:56,124 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-28 09:48:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-12-28 09:48:56,126 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-28 09:48:56,126 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-28 09:48:56,126 INFO L513 LassoAnalysis]: Proved termination. [2021-12-28 09:48:56,127 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2021-12-28 09:48:56,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2021-12-28 09:48:56,143 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-28 09:48:56,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 09:48:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:56,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-28 09:48:56,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:48:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 09:48:56,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-28 09:48:56,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 09:48:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 09:48:56,396 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 [2021-12-28 09:48:56,397 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:56,437 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 73 states and 101 transitions. cyclomatic complexity: 29. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 123 states and 180 transitions. Complement of second has 4 states. [2021-12-28 09:48:56,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2021-12-28 09:48:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:56,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2021-12-28 09:48:56,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 19 letters. [2021-12-28 09:48:56,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:48:56,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 42 letters. Loop has 19 letters. [2021-12-28 09:48:56,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:48:56,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 101 transitions. Stem has 23 letters. Loop has 38 letters. [2021-12-28 09:48:56,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-28 09:48:56,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 123 states and 180 transitions. [2021-12-28 09:48:56,444 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-28 09:48:56,444 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 123 states to 0 states and 0 transitions. [2021-12-28 09:48:56,444 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-28 09:48:56,445 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-28 09:48:56,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-28 09:48:56,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:48:56,445 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:48:56,445 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:48:56,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 09:48:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-28 09:48:56,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-28 09:48:56,446 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-28 09:48:56,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 09:48:56,446 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-12-28 09:48:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-28 09:48:56,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-12-28 09:48:56,448 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-28 09:48:56,448 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-12-28 09:48:56,448 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-28 09:48:56,448 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-28 09:48:56,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-28 09:48:56,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-28 09:48:56,449 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:48:56,449 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:48:56,449 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-28 09:48:56,449 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-28 09:48:56,449 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-28 09:48:56,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-28 09:48:56,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-28 09:48:56,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.12 09:48:56 BoogieIcfgContainer [2021-12-28 09:48:56,454 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-28 09:48:56,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 09:48:56,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 09:48:56,455 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 09:48:56,455 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 09:48:53" (3/4) ... [2021-12-28 09:48:56,457 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-28 09:48:56,457 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 09:48:56,457 INFO L158 Benchmark]: Toolchain (without parser) took 3693.35ms. Allocated memory was 54.5MB in the beginning and 81.8MB in the end (delta: 27.3MB). Free memory was 31.9MB in the beginning and 34.3MB in the end (delta: -2.4MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2021-12-28 09:48:56,458 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:48:56,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.31ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.7MB in the beginning and 49.7MB in the end (delta: -18.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2021-12-28 09:48:56,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.67ms. Allocated memory is still 67.1MB. Free memory was 49.6MB in the beginning and 47.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:48:56,458 INFO L158 Benchmark]: Boogie Preprocessor took 36.10ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 45.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:48:56,459 INFO L158 Benchmark]: RCFGBuilder took 382.40ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 44.7MB in the end (delta: 1.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2021-12-28 09:48:56,459 INFO L158 Benchmark]: BuchiAutomizer took 2947.18ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.7MB in the beginning and 34.9MB in the end (delta: 9.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. [2021-12-28 09:48:56,459 INFO L158 Benchmark]: Witness Printer took 2.08ms. Allocated memory is still 81.8MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 09:48:56,461 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 54.5MB. Free memory was 37.6MB in the beginning and 37.5MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.31ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.7MB in the beginning and 49.7MB in the end (delta: -18.1MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.67ms. Allocated memory is still 67.1MB. Free memory was 49.6MB in the beginning and 47.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.10ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 45.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.40ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 44.7MB in the end (delta: 1.2MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2947.18ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 44.7MB in the beginning and 34.9MB in the end (delta: 9.8MB). Peak memory consumption was 25.0MB. Max. memory is 16.1GB. * Witness Printer took 2.08ms. Allocated memory is still 81.8MB. Free memory is still 34.3MB. There was no memory consumed. Max. memory is 16.1GB. * 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 2.9s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 50 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 73 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 1140 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 699 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 441 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp30 ukn100 mio100 lsp100 div171 bol100 ite100 ukn100 eq152 hnf97 smp76 dnf105 smp94 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-28 09:48:56,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-12-28 09:48:56,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE