./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version e19ca921 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.3.1.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 d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 20:34:55,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 20:34:55,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 20:34:55,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 20:34:55,500 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 20:34:55,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 20:34:55,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 20:34:55,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 20:34:55,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 20:34:55,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 20:34:55,511 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 20:34:55,512 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 20:34:55,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 20:34:55,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 20:34:55,516 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 20:34:55,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 20:34:55,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 20:34:55,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 20:34:55,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 20:34:55,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 20:34:55,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 20:34:55,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 20:34:55,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 20:34:55,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 20:34:55,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 20:34:55,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 20:34:55,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 20:34:55,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 20:34:55,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 20:34:55,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 20:34:55,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 20:34:55,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 20:34:55,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 20:34:55,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 20:34:55,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 20:34:55,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 20:34:55,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 20:34:55,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 20:34:55,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 20:34:55,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 20:34:55,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 20:34:55,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-22 20:34:55,572 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 20:34:55,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 20:34:55,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 20:34:55,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 20:34:55,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 20:34:55,574 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 20:34:55,574 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 20:34:55,574 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-22 20:34:55,574 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-22 20:34:55,574 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-22 20:34:55,575 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-22 20:34:55,575 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-22 20:34:55,576 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-22 20:34:55,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 20:34:55,576 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 20:34:55,576 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-22 20:34:55,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 20:34:55,576 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 20:34:55,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 20:34:55,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-22 20:34:55,577 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-22 20:34:55,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-22 20:34:55,577 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 20:34:55,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 20:34:55,578 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-22 20:34:55,579 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 20:34:55,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-22 20:34:55,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 20:34:55,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 20:34:55,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 20:34:55,580 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 20:34:55,580 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 20:34:55,581 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-22 20:34:55,581 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 -> d852cbbb6aa933b5bfc297e03d0d3456bac2eafa50ad19971e71951b44cb15d3 [2021-12-22 20:34:55,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 20:34:55,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 20:34:55,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 20:34:55,875 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 20:34:55,876 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 20:34:55,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-12-22 20:34:55,944 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e70ab691/128c1426215c4deba64c5c28540edbc8/FLAG7bcd95e60 [2021-12-22 20:34:56,365 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 20:34:56,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-12-22 20:34:56,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e70ab691/128c1426215c4deba64c5c28540edbc8/FLAG7bcd95e60 [2021-12-22 20:34:56,756 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e70ab691/128c1426215c4deba64c5c28540edbc8 [2021-12-22 20:34:56,759 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 20:34:56,761 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 20:34:56,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 20:34:56,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 20:34:56,776 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 20:34:56,777 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:34:56" (1/1) ... [2021-12-22 20:34:56,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41ea4f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:56, skipping insertion in model container [2021-12-22 20:34:56,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 08:34:56" (1/1) ... [2021-12-22 20:34:56,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 20:34:56,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 20:34:57,038 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.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-12-22 20:34:57,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:34:57,058 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 20:34:57,113 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.3.1.ufo.BOUNDED-6.pals.c[5984,5997] [2021-12-22 20:34:57,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 20:34:57,146 INFO L208 MainTranslator]: Completed translation [2021-12-22 20:34:57,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57 WrapperNode [2021-12-22 20:34:57,159 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 20:34:57,161 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 20:34:57,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 20:34:57,162 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 20:34:57,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,239 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2021-12-22 20:34:57,240 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 20:34:57,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 20:34:57,241 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 20:34:57,241 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 20:34:57,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,286 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,288 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,292 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 20:34:57,295 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 20:34:57,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 20:34:57,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 20:34:57,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (1/1) ... [2021-12-22 20:34:57,302 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:34:57,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:34:57,347 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-22 20:34:57,353 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-22 20:34:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 20:34:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 20:34:57,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 20:34:57,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 20:34:57,532 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 20:34:57,533 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 20:34:57,837 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 20:34:57,842 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 20:34:57,849 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-22 20:34:57,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:34:57 BoogieIcfgContainer [2021-12-22 20:34:57,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 20:34:57,851 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-22 20:34:57,867 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-22 20:34:57,870 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-22 20:34:57,870 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:34:57,870 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.12 08:34:56" (1/3) ... [2021-12-22 20:34:57,871 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bf26a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:34:57, skipping insertion in model container [2021-12-22 20:34:57,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:34:57,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 08:34:57" (2/3) ... [2021-12-22 20:34:57,872 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bf26a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.12 08:34:57, skipping insertion in model container [2021-12-22 20:34:57,872 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-22 20:34:57,872 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:34:57" (3/3) ... [2021-12-22 20:34:57,873 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2021-12-22 20:34:57,918 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-22 20:34:57,927 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-22 20:34:57,927 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-22 20:34:57,927 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-22 20:34:57,928 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-22 20:34:57,928 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-22 20:34:57,928 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-22 20:34:57,928 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-22 20:34:57,948 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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-22 20:34:57,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-22 20:34:57,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:34:57,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:34:57,999 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:34:58,013 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-22 20:34:58,013 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-22 20:34:58,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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-22 20:34:58,016 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2021-12-22 20:34:58,019 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:34:58,019 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:34:58,022 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2021-12-22 20:34:58,022 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-22 20:34:58,031 INFO L791 eck$LassoCheckResult]: Stem: 44#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(34, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 36#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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~ret20#1, main_#t~ret21#1, main_#t~post22#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 41#L131true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 24#L131-1true init_#res#1 := init_~tmp~0#1; 59#L196true main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 60#L248true assume !(0 == main_~i2~0#1); 30#L248-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; 12#L256-2true [2021-12-22 20:34:58,049 INFO L793 eck$LassoCheckResult]: Loop: 12#L256-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 4#L54true 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; 34#L58true assume !(node1_~m1~0#1 != ~nomsg~0); 11#L58-1true ~mode1~0 := 0; 13#L54-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 20#L82true assume !(0 != ~mode2~0 % 256); 18#L95true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 29#L95-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 55#L82-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 50#L107true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 6#L110true assume !(node3_~m3~0#1 != ~nomsg~0); 16#L110-1true ~mode3~0 := 0; 61#L107-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; 37#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 49#L204-1true check_#res#1 := check_~tmp~1#1; 14#L224true main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 22#L280true assume !(0 == assert_~arg#1 % 256); 39#L275true assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 12#L256-2true [2021-12-22 20:34:58,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:58,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2021-12-22 20:34:58,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:58,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79906245] [2021-12-22 20:34:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:58,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:34:58,312 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-22 20:34:58,312 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:34:58,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79906245] [2021-12-22 20:34:58,313 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79906245] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:34:58,313 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:34:58,313 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:34:58,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309483560] [2021-12-22 20:34:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:34:58,318 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-12-22 20:34:58,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:58,352 INFO L85 PathProgramCache]: Analyzing trace with hash 855687206, now seen corresponding path program 1 times [2021-12-22 20:34:58,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:58,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207822323] [2021-12-22 20:34:58,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:58,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:34:58,589 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-22 20:34:58,599 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:34:58,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207822323] [2021-12-22 20:34:58,600 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207822323] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:34:58,600 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:34:58,600 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:34:58,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144872186] [2021-12-22 20:34:58,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:34:58,602 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:34:58,602 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:34:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:34:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:34:58,663 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 60 states have internal predecessors, (100), 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 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-22 20:34:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:34:58,798 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2021-12-22 20:34:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-22 20:34:58,803 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2021-12-22 20:34:58,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-22 20:34:58,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2021-12-22 20:34:58,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2021-12-22 20:34:58,822 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2021-12-22 20:34:58,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2021-12-22 20:34:58,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:34:58,823 INFO L681 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2021-12-22 20:34:58,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2021-12-22 20:34:58,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2021-12-22 20:34:58,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 55 states have internal predecessors, (76), 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-22 20:34:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2021-12-22 20:34:58,851 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-22 20:34:58,851 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2021-12-22 20:34:58,852 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-22 20:34:58,852 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2021-12-22 20:34:58,853 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-22 20:34:58,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:34:58,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:34:58,854 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] [2021-12-22 20:34:58,854 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-22 20:34:58,854 INFO L791 eck$LassoCheckResult]: Stem: 230#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(34, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 221#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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~ret20#1, main_#t~ret21#1, main_#t~post22#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 222#L131 assume 0 == ~r1~0; 227#L132 assume ~id1~0 >= 0; 225#L133 assume 0 == ~st1~0; 226#L134 assume ~send1~0 == ~id1~0; 219#L135 assume 0 == ~mode1~0 % 256; 198#L136 assume ~id2~0 >= 0; 199#L137 assume 0 == ~st2~0; 232#L138 assume ~send2~0 == ~id2~0; 210#L139 assume 0 == ~mode2~0 % 256; 211#L140 assume ~id3~0 >= 0; 228#L141 assume 0 == ~st3~0; 215#L142 assume ~send3~0 == ~id3~0; 213#L143 assume 0 == ~mode3~0 % 256; 187#L144 assume ~id1~0 != ~id2~0; 188#L145 assume ~id1~0 != ~id3~0; 201#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 202#L131-1 init_#res#1 := init_~tmp~0#1; 209#L196 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 233#L248 assume !(0 == main_~i2~0#1); 216#L248-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; 194#L256-2 [2021-12-22 20:34:58,854 INFO L793 eck$LassoCheckResult]: Loop: 194#L256-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 178#L54 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; 179#L58 assume !(node1_~m1~0#1 != ~nomsg~0); 192#L58-1 ~mode1~0 := 0; 193#L54-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 195#L82 assume !(0 != ~mode2~0 % 256); 203#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 204#L95-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 214#L82-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 231#L107 assume !(0 != ~mode3~0 % 256); 229#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 212#L120-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 200#L107-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; 223#L204 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 220#L204-1 check_#res#1 := check_~tmp~1#1; 196#L224 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 197#L280 assume !(0 == assert_~arg#1 % 256); 207#L275 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 194#L256-2 [2021-12-22 20:34:58,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:58,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2021-12-22 20:34:58,855 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:58,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129313725] [2021-12-22 20:34:58,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:58,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:58,872 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:34:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:58,905 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:34:58,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:58,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2073672604, now seen corresponding path program 1 times [2021-12-22 20:34:58,910 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:58,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578916410] [2021-12-22 20:34:58,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:58,911 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:34:59,048 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-22 20:34:59,055 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:34:59,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578916410] [2021-12-22 20:34:59,056 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578916410] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:34:59,056 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:34:59,057 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 20:34:59,057 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495372247] [2021-12-22 20:34:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:34:59,058 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:34:59,058 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:34:59,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 20:34:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 20:34:59,059 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 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-22 20:34:59,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:34:59,136 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2021-12-22 20:34:59,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 20:34:59,137 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2021-12-22 20:34:59,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-22 20:34:59,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2021-12-22 20:34:59,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2021-12-22 20:34:59,139 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2021-12-22 20:34:59,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2021-12-22 20:34:59,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:34:59,139 INFO L681 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-22 20:34:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2021-12-22 20:34:59,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2021-12-22 20:34:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 55 states have internal predecessors, (73), 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-22 20:34:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2021-12-22 20:34:59,142 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-22 20:34:59,142 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2021-12-22 20:34:59,142 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-22 20:34:59,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2021-12-22 20:34:59,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2021-12-22 20:34:59,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:34:59,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:34:59,152 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] [2021-12-22 20:34:59,152 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, 1] [2021-12-22 20:34:59,152 INFO L791 eck$LassoCheckResult]: Stem: 357#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(34, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 347#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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~ret20#1, main_#t~ret21#1, main_#t~post22#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 348#L131 assume 0 == ~r1~0; 354#L132 assume ~id1~0 >= 0; 352#L133 assume 0 == ~st1~0; 353#L134 assume ~send1~0 == ~id1~0; 346#L135 assume 0 == ~mode1~0 % 256; 325#L136 assume ~id2~0 >= 0; 326#L137 assume 0 == ~st2~0; 359#L138 assume ~send2~0 == ~id2~0; 337#L139 assume 0 == ~mode2~0 % 256; 338#L140 assume ~id3~0 >= 0; 355#L141 assume 0 == ~st3~0; 342#L142 assume ~send3~0 == ~id3~0; 340#L143 assume 0 == ~mode3~0 % 256; 314#L144 assume ~id1~0 != ~id2~0; 315#L145 assume ~id1~0 != ~id3~0; 328#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 329#L131-1 init_#res#1 := init_~tmp~0#1; 336#L196 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 360#L248 assume !(0 == main_~i2~0#1); 343#L248-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; 321#L256-2 [2021-12-22 20:34:59,153 INFO L793 eck$LassoCheckResult]: Loop: 321#L256-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 305#L54 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; 306#L58 assume !(node1_~m1~0#1 != ~nomsg~0); 319#L58-1 ~mode1~0 := 0; 320#L54-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 322#L82 assume !(0 != ~mode2~0 % 256); 330#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 331#L95-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 341#L82-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 358#L107 assume !(0 != ~mode3~0 % 256); 356#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 339#L120-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 327#L107-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; 349#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 316#L205 assume ~r1~0 >= 3; 318#L209 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 350#L204-1 check_#res#1 := check_~tmp~1#1; 323#L224 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 324#L280 assume !(0 == assert_~arg#1 % 256); 334#L275 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 321#L256-2 [2021-12-22 20:34:59,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2021-12-22 20:34:59,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:59,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366258606] [2021-12-22 20:34:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:59,154 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:59,176 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:34:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:59,224 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:34:59,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:59,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1481276532, now seen corresponding path program 1 times [2021-12-22 20:34:59,225 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:59,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569577038] [2021-12-22 20:34:59,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:59,226 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:59,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:34:59,276 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-22 20:34:59,276 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:34:59,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569577038] [2021-12-22 20:34:59,276 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569577038] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:34:59,276 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:34:59,277 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:34:59,277 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111591237] [2021-12-22 20:34:59,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:34:59,277 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-22 20:34:59,277 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:34:59,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:34:59,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:34:59,278 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-22 20:34:59,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:34:59,294 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2021-12-22 20:34:59,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 20:34:59,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2021-12-22 20:34:59,296 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-12-22 20:34:59,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2021-12-22 20:34:59,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2021-12-22 20:34:59,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2021-12-22 20:34:59,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2021-12-22 20:34:59,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:34:59,298 INFO L681 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-22 20:34:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2021-12-22 20:34:59,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2021-12-22 20:34:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 84 states have (on average 1.3452380952380953) internal successors, (113), 83 states have internal predecessors, (113), 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-22 20:34:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2021-12-22 20:34:59,302 INFO L704 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-22 20:34:59,302 INFO L587 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2021-12-22 20:34:59,302 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-22 20:34:59,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2021-12-22 20:34:59,303 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2021-12-22 20:34:59,303 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-22 20:34:59,303 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-22 20:34:59,304 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] [2021-12-22 20:34:59,304 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, 1, 1] [2021-12-22 20:34:59,304 INFO L791 eck$LassoCheckResult]: Stem: 506#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(34, 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;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0; 495#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, 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~ret20#1, main_#t~ret21#1, main_#t~post22#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~nondet7#1;havoc main_#t~nondet7#1;~id1~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~st1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~send1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~mode1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~id2~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~st2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~send2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~mode2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id3~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~st3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~send3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~mode3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 496#L131 assume 0 == ~r1~0; 503#L132 assume ~id1~0 >= 0; 501#L133 assume 0 == ~st1~0; 502#L134 assume ~send1~0 == ~id1~0; 492#L135 assume 0 == ~mode1~0 % 256; 470#L136 assume ~id2~0 >= 0; 471#L137 assume 0 == ~st2~0; 511#L138 assume ~send2~0 == ~id2~0; 482#L139 assume 0 == ~mode2~0 % 256; 483#L140 assume ~id3~0 >= 0; 504#L141 assume 0 == ~st3~0; 487#L142 assume ~send3~0 == ~id3~0; 485#L143 assume 0 == ~mode3~0 % 256; 460#L144 assume ~id1~0 != ~id2~0; 461#L145 assume ~id1~0 != ~id3~0; 473#L146 assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; 474#L131-1 init_#res#1 := init_~tmp~0#1; 481#L196 main_#t~ret20#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret20#1;havoc main_#t~ret20#1; 512#L248 assume !(0 == main_~i2~0#1); 488#L248-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; 466#L256-2 [2021-12-22 20:34:59,304 INFO L793 eck$LassoCheckResult]: Loop: 466#L256-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 451#L54 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; 452#L58 assume !(node1_~m1~0#1 != ~nomsg~0); 464#L58-1 ~mode1~0 := 0; 465#L54-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 467#L82 assume !(0 != ~mode2~0 % 256); 475#L95 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 476#L95-2 ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 486#L82-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 509#L107 assume !(0 != ~mode3~0 % 256); 505#L120 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 484#L120-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 472#L107-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; 513#L204 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 514#L205 assume !(~r1~0 >= 3); 493#L208 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 494#L209 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 508#L204-1 check_#res#1 := check_~tmp~1#1; 468#L224 main_#t~ret21#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret21#1;havoc main_#t~ret21#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; 469#L280 assume !(0 == assert_~arg#1 % 256); 479#L275 assume { :end_inline_assert } true;main_#t~post22#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post22#1;havoc main_#t~post22#1; 466#L256-2 [2021-12-22 20:34:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:59,305 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2021-12-22 20:34:59,305 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:59,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693832670] [2021-12-22 20:34:59,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:59,305 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:59,316 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:34:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:59,327 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:34:59,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1323327703, now seen corresponding path program 1 times [2021-12-22 20:34:59,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:59,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10549004] [2021-12-22 20:34:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:59,329 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:59,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 20:34:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 20:34:59,350 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 20:34:59,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:34:59,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1693614955, now seen corresponding path program 1 times [2021-12-22 20:34:59,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 20:34:59,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016275928] [2021-12-22 20:34:59,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 20:34:59,351 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 20:34:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:34:59,387 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-22 20:34:59,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 20:34:59,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016275928] [2021-12-22 20:34:59,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016275928] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 20:34:59,388 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 20:34:59,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-22 20:34:59,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176462260] [2021-12-22 20:34:59,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 20:35:00,172 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:35:00,173 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:35:00,173 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:35:00,173 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:35:00,173 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2021-12-22 20:35:00,173 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:00,173 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:35:00,174 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:35:00,174 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-22 20:35:00,174 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:35:00,174 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:35:00,207 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-22 20:35:00,218 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-22 20:35:00,226 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-22 20:35:00,324 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-22 20:35:00,327 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-22 20:35:00,330 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-22 20:35:00,347 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-22 20:35:00,352 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-22 20:35:00,356 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-22 20:35:00,359 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-22 20:35:00,361 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-22 20:35:00,366 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-22 20:35:00,369 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-22 20:35:00,371 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-22 20:35:00,758 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-12-22 20:35:03,240 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:35:03,240 INFO L404 LassoAnalysis]: Checking for nontermination... [2021-12-22 20:35:03,242 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:03,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:03,263 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-22 20:35:03,291 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-22 20:35:03,294 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2021-12-22 20:35:03,294 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-22 20:35:03,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-12-22 20:35:03,334 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:03,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:03,337 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-22 20:35:03,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2021-12-22 20:35:03,385 INFO L160 nArgumentSynthesizer]: Using integer mode. [2021-12-22 20:35:03,393 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-22 20:35:03,569 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2021-12-22 20:35:03,575 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-22 20:35:03,576 INFO L210 LassoAnalysis]: Preferences: [2021-12-22 20:35:03,576 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-12-22 20:35:03,576 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-12-22 20:35:03,576 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-12-22 20:35:03,576 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-12-22 20:35:03,576 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:03,576 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-12-22 20:35:03,576 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-12-22 20:35:03,577 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2021-12-22 20:35:03,577 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-12-22 20:35:03,577 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-12-22 20:35:03,579 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-22 20:35:03,593 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-22 20:35:03,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-22 20:35:03,605 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-22 20:35:03,606 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-22 20:35:03,630 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-22 20:35:03,728 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-22 20:35:03,733 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-22 20:35:03,738 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-22 20:35:03,740 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-22 20:35:03,742 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-22 20:35:03,745 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-22 20:35:03,756 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-22 20:35:03,761 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-22 20:35:04,155 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2021-12-22 20:35:06,374 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-12-22 20:35:06,377 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-12-22 20:35:06,380 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,381 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-22 20:35:06,382 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-22 20:35:06,383 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-22 20:35:06,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,393 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:35:06,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:35:06,397 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:35:06,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2021-12-22 20:35:06,430 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,431 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-22 20:35:06,433 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-22 20:35:06,435 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-22 20:35:06,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,442 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,442 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:35:06,442 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,453 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:35:06,453 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,458 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:35:06,480 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-22 20:35:06,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,483 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-22 20:35:06,486 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-22 20:35:06,495 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-22 20:35:06,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:35:06,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:35:06,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,507 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:35:06,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-12-22 20:35:06,526 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,527 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-22 20:35:06,529 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-22 20:35:06,530 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-22 20:35:06,540 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:35:06,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:35:06,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:35:06,575 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-22 20:35:06,580 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,582 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-22 20:35:06,584 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-22 20:35:06,585 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-22 20:35:06,591 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,591 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,591 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,591 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2021-12-22 20:35:06,591 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,594 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2021-12-22 20:35:06,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,610 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:35:06,629 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-22 20:35:06,630 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,631 INFO L229 MonitoredProcess]: Starting monitored process 9 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-22 20:35:06,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-12-22 20:35:06,633 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-22 20:35:06,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,642 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2021-12-22 20:35:06,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,774 INFO L401 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2021-12-22 20:35:06,774 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,830 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-12-22 20:35:06,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-12-22 20:35:06,850 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,851 INFO L229 MonitoredProcess]: Starting monitored process 10 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-22 20:35:06,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-12-22 20:35:06,854 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-22 20:35:06,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-12-22 20:35:06,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-12-22 20:35:06,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-12-22 20:35:06,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-12-22 20:35:06,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-12-22 20:35:06,863 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-12-22 20:35:06,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-12-22 20:35:06,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-12-22 20:35:06,896 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2021-12-22 20:35:06,896 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2021-12-22 20:35:06,897 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-22 20:35:06,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 20:35:06,904 INFO L229 MonitoredProcess]: Starting monitored process 11 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-22 20:35:06,908 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-12-22 20:35:06,908 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2021-12-22 20:35:06,909 INFO L513 LassoAnalysis]: Proved termination. [2021-12-22 20:35:06,909 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-22 20:35:06,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-12-22 20:35:06,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-12-22 20:35:06,969 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2021-12-22 20:35:06,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 20:35:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:35:07,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-22 20:35:07,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:35:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 20:35:07,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-22 20:35:07,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 20:35:07,224 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-22 20:35:07,227 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-22 20:35:07,228 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-22 20:35:07,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 145 states and 204 transitions. Complement of second has 4 states. [2021-12-22 20:35:07,272 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-22 20:35:07,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-22 20:35:07,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2021-12-22 20:35:07,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2021-12-22 20:35:07,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:35:07,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2021-12-22 20:35:07,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:35:07,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2021-12-22 20:35:07,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-12-22 20:35:07,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2021-12-22 20:35:07,287 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-22 20:35:07,287 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2021-12-22 20:35:07,287 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-22 20:35:07,287 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-22 20:35:07,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-22 20:35:07,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:35:07,287 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:35:07,288 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:35:07,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 20:35:07,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 20:35:07,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 20:35:07,289 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-22 20:35:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 20:35:07,289 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2021-12-22 20:35:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-22 20:35:07,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2021-12-22 20:35:07,291 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-22 20:35:07,291 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2021-12-22 20:35:07,291 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-12-22 20:35:07,291 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-12-22 20:35:07,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-12-22 20:35:07,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 20:35:07,292 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:35:07,292 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:35:07,292 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-22 20:35:07,292 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-22 20:35:07,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-12-22 20:35:07,292 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-12-22 20:35:07,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-12-22 20:35:07,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.12 08:35:07 BoogieIcfgContainer [2021-12-22 20:35:07,301 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-12-22 20:35:07,302 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 20:35:07,302 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 20:35:07,303 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 20:35:07,303 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 08:34:57" (3/4) ... [2021-12-22 20:35:07,305 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-22 20:35:07,306 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 20:35:07,307 INFO L158 Benchmark]: Toolchain (without parser) took 10545.29ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 100.1MB in the beginning and 63.7MB in the end (delta: 36.4MB). Peak memory consumption was 63.7MB. Max. memory is 16.1GB. [2021-12-22 20:35:07,307 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:35:07,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.35ms. Allocated memory is still 130.0MB. Free memory was 99.7MB in the beginning and 105.1MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 20:35:07,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.79ms. Allocated memory is still 130.0MB. Free memory was 105.1MB in the beginning and 103.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:35:07,311 INFO L158 Benchmark]: Boogie Preprocessor took 53.11ms. Allocated memory is still 130.0MB. Free memory was 103.4MB in the beginning and 101.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 20:35:07,316 INFO L158 Benchmark]: RCFGBuilder took 556.05ms. Allocated memory is still 130.0MB. Free memory was 101.9MB in the beginning and 87.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-22 20:35:07,316 INFO L158 Benchmark]: BuchiAutomizer took 9449.57ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 86.7MB in the beginning and 63.7MB in the end (delta: 23.0MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. [2021-12-22 20:35:07,316 INFO L158 Benchmark]: Witness Printer took 3.37ms. Allocated memory is still 157.3MB. Free memory is still 63.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 20:35:07,319 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.21ms. Allocated memory is still 86.0MB. Free memory is still 45.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.35ms. Allocated memory is still 130.0MB. Free memory was 99.7MB in the beginning and 105.1MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.79ms. Allocated memory is still 130.0MB. Free memory was 105.1MB in the beginning and 103.4MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.11ms. Allocated memory is still 130.0MB. Free memory was 103.4MB in the beginning and 101.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 556.05ms. Allocated memory is still 130.0MB. Free memory was 101.9MB in the beginning and 87.1MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9449.57ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 86.7MB in the beginning and 63.7MB in the end (delta: 23.0MB). Peak memory consumption was 51.7MB. Max. memory is 16.1GB. * Witness Printer took 3.37ms. Allocated memory is still 157.3MB. Free memory is still 63.7MB. 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 9.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.5s. Construction of modules took 0.1s. 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, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 932 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 585 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 347 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital175 mio100 ax100 hnf100 lsp66 ukn77 mio100 lsp100 div168 bol100 ite100 ukn100 eq165 hnf94 smp72 dnf2826 smp41 tf100 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 200ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-12-22 20:35:07,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-12-22 20:35:07,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE