./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 791161d1 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-?-791161d [2022-07-23 15:44:46,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 15:44:46,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 15:44:46,284 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 15:44:46,284 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 15:44:46,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 15:44:46,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 15:44:46,293 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 15:44:46,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 15:44:46,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 15:44:46,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 15:44:46,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 15:44:46,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 15:44:46,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 15:44:46,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 15:44:46,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 15:44:46,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 15:44:46,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 15:44:46,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 15:44:46,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 15:44:46,320 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 15:44:46,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 15:44:46,322 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 15:44:46,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 15:44:46,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 15:44:46,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 15:44:46,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 15:44:46,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 15:44:46,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 15:44:46,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 15:44:46,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 15:44:46,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 15:44:46,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 15:44:46,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 15:44:46,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 15:44:46,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 15:44:46,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 15:44:46,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 15:44:46,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 15:44:46,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 15:44:46,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 15:44:46,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 15:44:46,343 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-23 15:44:46,380 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 15:44:46,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 15:44:46,381 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 15:44:46,381 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 15:44:46,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 15:44:46,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 15:44:46,383 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 15:44:46,383 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-23 15:44:46,383 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-23 15:44:46,384 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-23 15:44:46,384 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-23 15:44:46,384 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-23 15:44:46,385 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-23 15:44:46,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 15:44:46,385 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 15:44:46,385 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 15:44:46,386 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 15:44:46,387 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 15:44:46,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 15:44:46,387 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-23 15:44:46,387 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-23 15:44:46,387 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-23 15:44:46,387 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 15:44:46,388 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 15:44:46,388 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-23 15:44:46,388 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 15:44:46,388 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-23 15:44:46,388 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 15:44:46,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 15:44:46,389 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 15:44:46,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 15:44:46,390 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-23 15:44:46,390 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 [2022-07-23 15:44:46,668 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 15:44:46,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 15:44:46,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 15:44:46,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 15:44:46,703 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 15:44:46,713 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 [2022-07-23 15:44:46,773 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89145dad/623ef731153f4031bbc1ef800befe75d/FLAG480a3c4ed [2022-07-23 15:44:47,229 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 15:44:47,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-07-23 15:44:47,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89145dad/623ef731153f4031bbc1ef800befe75d/FLAG480a3c4ed [2022-07-23 15:44:47,618 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f89145dad/623ef731153f4031bbc1ef800befe75d [2022-07-23 15:44:47,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 15:44:47,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 15:44:47,624 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 15:44:47,625 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 15:44:47,627 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 15:44:47,628 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:47,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d6b6881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47, skipping insertion in model container [2022-07-23 15:44:47,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:47,635 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 15:44:47,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 15:44:47,860 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] [2022-07-23 15:44:47,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:44:47,868 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 15:44:47,899 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] [2022-07-23 15:44:47,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 15:44:47,923 INFO L208 MainTranslator]: Completed translation [2022-07-23 15:44:47,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47 WrapperNode [2022-07-23 15:44:47,931 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 15:44:47,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 15:44:47,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 15:44:47,933 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 15:44:47,939 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:47,955 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:47,982 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2022-07-23 15:44:47,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 15:44:47,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 15:44:47,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 15:44:47,985 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 15:44:47,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:47,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,009 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,011 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 15:44:48,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 15:44:48,014 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 15:44:48,014 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 15:44:48,015 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (1/1) ... [2022-07-23 15:44:48,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:48,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:48,044 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) [2022-07-23 15:44:48,053 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 [2022-07-23 15:44:48,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 15:44:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 15:44:48,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 15:44:48,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 15:44:48,196 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 15:44:48,212 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 15:44:48,512 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 15:44:48,518 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 15:44:48,525 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-23 15:44:48,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:44:48 BoogieIcfgContainer [2022-07-23 15:44:48,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 15:44:48,530 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-23 15:44:48,531 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-23 15:44:48,534 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-23 15:44:48,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:44:48,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.07 03:44:47" (1/3) ... [2022-07-23 15:44:48,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e41f677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:44:48, skipping insertion in model container [2022-07-23 15:44:48,537 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:44:48,537 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 03:44:47" (2/3) ... [2022-07-23 15:44:48,537 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3e41f677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.07 03:44:48, skipping insertion in model container [2022-07-23 15:44:48,538 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-23 15:44:48,538 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:44:48" (3/3) ... [2022-07-23 15:44:48,539 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.1.ufo.BOUNDED-6.pals.c [2022-07-23 15:44:48,627 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-23 15:44:48,627 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-23 15:44:48,627 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-23 15:44:48,627 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-23 15:44:48,627 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-23 15:44:48,627 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-23 15:44:48,628 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-23 15:44:48,628 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-23 15:44:48,639 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) [2022-07-23 15:44:48,662 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-23 15:44:48,662 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:44:48,663 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:44:48,681 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:48,681 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:48,681 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-23 15:44:48,682 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) [2022-07-23 15:44:48,691 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 35 [2022-07-23 15:44:48,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:44:48,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:44:48,694 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:48,694 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:48,701 INFO L752 eck$LassoCheckResult]: Stem: 43#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; 35#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; 40#L131true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 23#L131-1true init_#res#1 := init_~tmp~0#1; 58#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; 59#L248true assume !(0 == main_~i2~0#1); 29#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; 11#L256-2true [2022-07-23 15:44:48,703 INFO L754 eck$LassoCheckResult]: Loop: 11#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; 3#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; 33#L58true assume !(node1_~m1~0#1 != ~nomsg~0); 10#L58-1true ~mode1~0 := 0; 12#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; 19#L82true assume !(0 != ~mode2~0 % 256); 17#L95true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 28#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; 54#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; 49#L107true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 5#L110true assume !(node3_~m3~0#1 != ~nomsg~0); 15#L110-1true ~mode3~0 := 0; 60#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; 36#L204true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 48#L204-1true check_#res#1 := check_~tmp~1#1; 13#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; 21#L280true assume !(0 == assert_~arg#1 % 256); 38#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; 11#L256-2true [2022-07-23 15:44:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:48,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2022-07-23 15:44:48,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:48,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259065530] [2022-07-23 15:44:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:48,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:48,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:44:48,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:44:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259065530] [2022-07-23 15:44:48,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259065530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:44:48,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:44:48,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:44:48,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358010902] [2022-07-23 15:44:48,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:44:48,930 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-23 15:44:48,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 855687206, now seen corresponding path program 1 times [2022-07-23 15:44:48,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:48,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629245077] [2022-07-23 15:44:48,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:44:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:44:49,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629245077] [2022-07-23 15:44:49,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629245077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:44:49,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:44:49,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:44:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476619443] [2022-07-23 15:44:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:44:49,129 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:44:49,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:44:49,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:44:49,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:44:49,165 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) [2022-07-23 15:44:49,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:44:49,255 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2022-07-23 15:44:49,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 15:44:49,264 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2022-07-23 15:44:49,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-07-23 15:44:49,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2022-07-23 15:44:49,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2022-07-23 15:44:49,300 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2022-07-23 15:44:49,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2022-07-23 15:44:49,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:44:49,301 INFO L369 hiAutomatonCegarLoop]: Abstraction has 90 states and 130 transitions. [2022-07-23 15:44:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2022-07-23 15:44:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2022-07-23 15:44:49,324 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) [2022-07-23 15:44:49,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2022-07-23 15:44:49,326 INFO L392 hiAutomatonCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-23 15:44:49,326 INFO L374 stractBuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2022-07-23 15:44:49,326 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-23 15:44:49,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2022-07-23 15:44:49,327 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-07-23 15:44:49,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:44:49,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:44:49,329 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:44:49,329 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:49,329 INFO L752 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 [2022-07-23 15:44:49,329 INFO L754 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 [2022-07-23 15:44:49,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2022-07-23 15:44:49,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853241825] [2022-07-23 15:44:49,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,347 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:44:49,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:44:49,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash 2073672604, now seen corresponding path program 1 times [2022-07-23 15:44:49,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033176356] [2022-07-23 15:44:49,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:44:49,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:44:49,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033176356] [2022-07-23 15:44:49,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033176356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:44:49,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:44:49,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 15:44:49,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982240884] [2022-07-23 15:44:49,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:44:49,457 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:44:49,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:44:49,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 15:44:49,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 15:44:49,459 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) [2022-07-23 15:44:49,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:44:49,498 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2022-07-23 15:44:49,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 15:44:49,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2022-07-23 15:44:49,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-07-23 15:44:49,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2022-07-23 15:44:49,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2022-07-23 15:44:49,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2022-07-23 15:44:49,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2022-07-23 15:44:49,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:44:49,502 INFO L369 hiAutomatonCegarLoop]: Abstraction has 56 states and 73 transitions. [2022-07-23 15:44:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2022-07-23 15:44:49,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-23 15:44:49,506 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) [2022-07-23 15:44:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2022-07-23 15:44:49,507 INFO L392 hiAutomatonCegarLoop]: Abstraction has 56 states and 73 transitions. [2022-07-23 15:44:49,507 INFO L374 stractBuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2022-07-23 15:44:49,507 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-23 15:44:49,507 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2022-07-23 15:44:49,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2022-07-23 15:44:49,508 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:44:49,508 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:44:49,509 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:44:49,509 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:49,510 INFO L752 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 [2022-07-23 15:44:49,510 INFO L754 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 [2022-07-23 15:44:49,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2022-07-23 15:44:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057783391] [2022-07-23 15:44:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,524 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:44:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:44:49,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1481276532, now seen corresponding path program 1 times [2022-07-23 15:44:49,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544220183] [2022-07-23 15:44:49,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:44:49,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:44:49,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544220183] [2022-07-23 15:44:49,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544220183] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:44:49,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:44:49,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:44:49,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59865857] [2022-07-23 15:44:49,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:44:49,595 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-23 15:44:49,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:44:49,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:44:49,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:44:49,598 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) [2022-07-23 15:44:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:44:49,625 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2022-07-23 15:44:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 15:44:49,626 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2022-07-23 15:44:49,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-07-23 15:44:49,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2022-07-23 15:44:49,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2022-07-23 15:44:49,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2022-07-23 15:44:49,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2022-07-23 15:44:49,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:44:49,641 INFO L369 hiAutomatonCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-07-23 15:44:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2022-07-23 15:44:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-07-23 15:44:49,648 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) [2022-07-23 15:44:49,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2022-07-23 15:44:49,652 INFO L392 hiAutomatonCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-07-23 15:44:49,652 INFO L374 stractBuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2022-07-23 15:44:49,652 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-23 15:44:49,652 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2022-07-23 15:44:49,653 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2022-07-23 15:44:49,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-23 15:44:49,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-23 15:44:49,658 INFO L179 hiAutomatonCegarLoop]: 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] [2022-07-23 15:44:49,659 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 15:44:49,659 INFO L752 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 [2022-07-23 15:44:49,660 INFO L754 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 [2022-07-23 15:44:49,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2022-07-23 15:44:49,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977984070] [2022-07-23 15:44:49,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,685 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:44:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:44:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1323327703, now seen corresponding path program 1 times [2022-07-23 15:44:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462880494] [2022-07-23 15:44:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,739 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-23 15:44:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-23 15:44:49,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-23 15:44:49,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1693614955, now seen corresponding path program 1 times [2022-07-23 15:44:49,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 15:44:49,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028158670] [2022-07-23 15:44:49,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 15:44:49,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 15:44:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:49,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:44:49,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 15:44:49,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028158670] [2022-07-23 15:44:49,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028158670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 15:44:49,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 15:44:49,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 15:44:49,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888991870] [2022-07-23 15:44:49,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 15:44:50,498 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:44:50,499 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:44:50,499 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:44:50,499 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:44:50,499 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-23 15:44:50,499 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:50,499 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:44:50,500 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:44:50,500 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-23 15:44:50,500 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:44:50,500 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:44:50,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:50,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:51,075 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-07-23 15:44:53,685 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:44:53,686 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-23 15:44:53,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:53,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:53,695 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) [2022-07-23 15:44:53,699 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 [2022-07-23 15:44:53,700 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-23 15:44:53,700 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:44:53,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-23 15:44:53,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:53,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:53,731 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) [2022-07-23 15:44:53,732 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 [2022-07-23 15:44:53,733 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-23 15:44:53,733 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-23 15:44:53,837 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-23 15:44:53,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-23 15:44:53,842 INFO L210 LassoAnalysis]: Preferences: [2022-07-23 15:44:53,842 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-23 15:44:53,842 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-23 15:44:53,842 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-23 15:44:53,843 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-23 15:44:53,843 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:53,843 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-23 15:44:53,843 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-23 15:44:53,843 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-07-23 15:44:53,843 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-23 15:44:53,843 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-23 15:44:53,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:53,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:54,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:54,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:54,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-23 15:44:54,380 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-07-23 15:44:56,805 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-23 15:44:56,809 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-23 15:44:56,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:56,812 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) [2022-07-23 15:44:56,813 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 [2022-07-23 15:44:56,814 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 [2022-07-23 15:44:56,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:56,820 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:56,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:56,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:44:56,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:56,823 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:44:56,824 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:56,844 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:44:56,868 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-23 15:44:56,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:56,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:56,870 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) [2022-07-23 15:44:56,871 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 [2022-07-23 15:44:56,871 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 [2022-07-23 15:44:56,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:56,877 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:56,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:56,878 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:44:56,878 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:56,879 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:44:56,879 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:56,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:44:56,930 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 [2022-07-23 15:44:56,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:56,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:56,932 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) [2022-07-23 15:44:56,938 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 [2022-07-23 15:44:56,945 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:56,945 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:56,946 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:56,946 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:44:56,946 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:56,947 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:44:56,947 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:56,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:44:56,951 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 [2022-07-23 15:44:56,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-23 15:44:56,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:56,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:56,965 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) [2022-07-23 15:44:56,966 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 [2022-07-23 15:44:56,966 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 [2022-07-23 15:44:56,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:56,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:56,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:56,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:44:56,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:56,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:44:56,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:56,977 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:44:56,994 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 [2022-07-23 15:44:56,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:56,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:56,996 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) [2022-07-23 15:44:56,998 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 [2022-07-23 15:44:56,999 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 [2022-07-23 15:44:57,005 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:57,005 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:57,005 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:57,005 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-23 15:44:57,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:57,009 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-23 15:44:57,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:57,011 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:44:57,027 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 [2022-07-23 15:44:57,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:57,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:57,028 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) [2022-07-23 15:44:57,029 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 [2022-07-23 15:44:57,031 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 [2022-07-23 15:44:57,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:57,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:57,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:57,038 INFO L204 nArgumentSynthesizer]: 16 loop disjuncts [2022-07-23 15:44:57,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:57,120 INFO L401 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2022-07-23 15:44:57,120 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:57,194 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-23 15:44:57,221 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 [2022-07-23 15:44:57,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:57,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:57,223 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) [2022-07-23 15:44:57,233 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 [2022-07-23 15:44:57,234 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 [2022-07-23 15:44:57,241 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-23 15:44:57,241 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-23 15:44:57,241 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-23 15:44:57,241 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-23 15:44:57,241 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-23 15:44:57,242 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-23 15:44:57,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-23 15:44:57,255 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-23 15:44:57,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-23 15:44:57,268 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-23 15:44:57,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-23 15:44:57,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 15:44:57,277 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) [2022-07-23 15:44:57,308 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-23 15:44:57,308 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-23 15:44:57,308 INFO L513 LassoAnalysis]: Proved termination. [2022-07-23 15:44:57,309 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 [] [2022-07-23 15:44:57,314 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 [2022-07-23 15:44:57,334 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 [2022-07-23 15:44:57,336 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-23 15:44:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 15:44:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:57,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-23 15:44:57,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:44:57,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 15:44:57,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 15:44:57,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 15:44:57,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 15:44:57,615 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 [2022-07-23 15:44:57,615 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) [2022-07-23 15:44:57,639 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 [2022-07-23 15:44:57,659 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. [2022-07-23 15:44:57,660 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 [2022-07-23 15:44:57,661 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) [2022-07-23 15:44:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2022-07-23 15:44:57,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2022-07-23 15:44:57,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:44:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2022-07-23 15:44:57,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:44:57,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2022-07-23 15:44:57,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-23 15:44:57,665 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2022-07-23 15:44:57,667 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:44:57,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2022-07-23 15:44:57,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:44:57,667 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:44:57,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:44:57,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:44:57,667 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:44:57,668 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:44:57,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 15:44:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 15:44:57,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 15:44:57,669 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) [2022-07-23 15:44:57,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 15:44:57,669 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-23 15:44:57,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-23 15:44:57,670 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-23 15:44:57,670 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:44:57,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-23 15:44:57,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-23 15:44:57,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-23 15:44:57,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-23 15:44:57,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-23 15:44:57,671 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:44:57,671 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:44:57,671 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 15:44:57,671 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-23 15:44:57,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-23 15:44:57,671 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-23 15:44:57,671 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-23 15:44:57,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.07 03:44:57 BoogieIcfgContainer [2022-07-23 15:44:57,678 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-23 15:44:57,679 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-23 15:44:57,679 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-23 15:44:57,679 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-23 15:44:57,679 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 03:44:48" (3/4) ... [2022-07-23 15:44:57,682 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-23 15:44:57,682 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-23 15:44:57,683 INFO L158 Benchmark]: Toolchain (without parser) took 10061.23ms. Allocated memory was 81.8MB in the beginning and 138.4MB in the end (delta: 56.6MB). Free memory was 49.6MB in the beginning and 102.0MB in the end (delta: -52.4MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-23 15:44:57,683 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 81.8MB. Free memory was 62.6MB in the beginning and 62.6MB in the end (delta: 19.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:44:57,684 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.39ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.4MB in the beginning and 73.0MB in the end (delta: -23.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-07-23 15:44:57,684 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.98ms. Allocated memory is still 98.6MB. Free memory was 73.0MB in the beginning and 71.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:44:57,685 INFO L158 Benchmark]: Boogie Preprocessor took 29.18ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-23 15:44:57,685 INFO L158 Benchmark]: RCFGBuilder took 514.96ms. Allocated memory is still 98.6MB. Free memory was 69.4MB in the beginning and 55.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-23 15:44:57,686 INFO L158 Benchmark]: BuchiAutomizer took 9148.30ms. Allocated memory was 98.6MB in the beginning and 138.4MB in the end (delta: 39.8MB). Free memory was 54.8MB in the beginning and 102.0MB in the end (delta: -47.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:44:57,686 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 138.4MB. Free memory is still 102.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 15:44:57,688 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.39ms. Allocated memory is still 81.8MB. Free memory was 62.6MB in the beginning and 62.6MB in the end (delta: 19.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.39ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 49.4MB in the beginning and 73.0MB in the end (delta: -23.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.98ms. Allocated memory is still 98.6MB. Free memory was 73.0MB in the beginning and 71.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.18ms. Allocated memory is still 98.6MB. Free memory was 71.1MB in the beginning and 69.4MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.96ms. Allocated memory is still 98.6MB. Free memory was 69.4MB in the beginning and 55.1MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9148.30ms. Allocated memory was 98.6MB in the beginning and 138.4MB in the end (delta: 39.8MB). Free memory was 54.8MB in the beginning and 102.0MB in the end (delta: -47.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 138.4MB. Free memory is still 102.0MB. 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.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 8.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. 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: inital176 mio100 ax100 hnf100 lsp65 ukn77 mio100 lsp100 div168 bol100 ite100 ukn100 eq165 hnf94 smp72 dnf2826 smp41 tf100 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 166ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-23 15:44:57,721 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