./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 35987657 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.4.1.ufo.BOUNDED-8.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 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-22 02:55:43,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 02:55:43,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 02:55:43,219 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 02:55:43,219 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 02:55:43,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 02:55:43,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 02:55:43,227 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 02:55:43,229 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 02:55:43,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 02:55:43,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 02:55:43,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 02:55:43,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 02:55:43,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 02:55:43,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 02:55:43,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 02:55:43,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 02:55:43,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 02:55:43,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 02:55:43,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 02:55:43,254 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 02:55:43,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 02:55:43,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 02:55:43,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 02:55:43,259 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 02:55:43,265 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 02:55:43,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 02:55:43,267 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 02:55:43,267 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 02:55:43,268 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 02:55:43,269 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 02:55:43,269 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 02:55:43,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 02:55:43,271 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 02:55:43,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 02:55:43,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 02:55:43,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 02:55:43,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 02:55:43,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 02:55:43,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 02:55:43,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 02:55:43,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 02:55:43,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-22 02:55:43,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 02:55:43,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 02:55:43,319 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 02:55:43,320 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 02:55:43,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 02:55:43,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 02:55:43,321 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 02:55:43,322 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 02:55:43,322 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 02:55:43,323 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 02:55:43,323 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 02:55:43,323 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 02:55:43,328 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 02:55:43,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 02:55:43,329 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 02:55:43,329 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 02:55:43,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 02:55:43,330 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 02:55:43,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 02:55:43,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 02:55:43,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 02:55:43,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 02:55:43,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 02:55:43,331 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 02:55:43,331 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 02:55:43,331 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 02:55:43,332 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 02:55:43,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 02:55:43,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 02:55:43,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 02:55:43,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 02:55:43,335 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 02:55:43,335 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 -> 5d3b64744a19af136ca9c439b2264a15465f658e2e3d4a576a98d96e4b8aff92 [2022-07-22 02:55:43,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 02:55:43,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 02:55:43,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 02:55:43,682 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 02:55:43,683 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 02:55:43,685 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-07-22 02:55:43,750 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faed55a2d/e4069593f16a4ddb9fabd130ade411de/FLAG094cc0706 [2022-07-22 02:55:44,199 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 02:55:44,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-07-22 02:55:44,211 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faed55a2d/e4069593f16a4ddb9fabd130ade411de/FLAG094cc0706 [2022-07-22 02:55:44,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faed55a2d/e4069593f16a4ddb9fabd130ade411de [2022-07-22 02:55:44,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 02:55:44,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 02:55:44,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 02:55:44,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 02:55:44,598 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 02:55:44,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:44,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32396294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44, skipping insertion in model container [2022-07-22 02:55:44,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:44,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 02:55:44,649 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 02:55:44,831 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.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2022-07-22 02:55:44,832 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:55:44,851 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 02:55:44,915 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.4.1.ufo.BOUNDED-8.pals.c[8246,8259] [2022-07-22 02:55:44,916 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 02:55:44,928 INFO L208 MainTranslator]: Completed translation [2022-07-22 02:55:44,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44 WrapperNode [2022-07-22 02:55:44,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 02:55:44,930 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 02:55:44,930 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 02:55:44,931 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 02:55:44,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:44,954 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:44,992 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 260 [2022-07-22 02:55:44,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 02:55:44,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 02:55:44,995 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 02:55:44,995 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 02:55:45,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,013 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,014 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,022 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,036 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 02:55:45,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 02:55:45,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 02:55:45,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 02:55:45,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (1/1) ... [2022-07-22 02:55:45,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:55:45,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:55:45,084 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-22 02:55:45,119 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-22 02:55:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 02:55:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 02:55:45,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 02:55:45,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 02:55:45,233 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 02:55:45,234 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 02:55:45,536 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 02:55:45,542 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 02:55:45,542 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 02:55:45,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:55:45 BoogieIcfgContainer [2022-07-22 02:55:45,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 02:55:45,545 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 02:55:45,545 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 02:55:45,547 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 02:55:45,548 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:55:45,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 02:55:44" (1/3) ... [2022-07-22 02:55:45,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@250b5ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:55:45, skipping insertion in model container [2022-07-22 02:55:45,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:55:45,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:55:44" (2/3) ... [2022-07-22 02:55:45,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@250b5ac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 02:55:45, skipping insertion in model container [2022-07-22 02:55:45,549 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 02:55:45,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:55:45" (3/3) ... [2022-07-22 02:55:45,551 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.1.ufo.BOUNDED-8.pals.c [2022-07-22 02:55:45,623 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 02:55:45,629 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-22 02:55:45,629 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 02:55:45,629 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 02:55:45,629 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 02:55:45,630 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-22 02:55:45,630 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 02:55:45,630 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 02:55:45,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 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-22 02:55:45,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-07-22 02:55:45,666 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:55:45,666 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:55:45,684 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:55:45,684 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, 1] [2022-07-22 02:55:45,685 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 02:55:45,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 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-22 02:55:45,697 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-07-22 02:55:45,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:55:45,698 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:55:45,700 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:55:45,700 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, 1] [2022-07-22 02:55:45,709 INFO L752 eck$LassoCheckResult]: Stem: 59#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 47#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 60#L163true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 24#L163-1true init_#res#1 := init_~tmp~0#1; 58#L256true main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 70#L312true assume !(0 == main_~i2~0#1); 16#L312-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 10#L322-2true [2022-07-22 02:55:45,715 INFO L754 eck$LassoCheckResult]: Loop: 10#L322-2true assume !!(main_~i2~0#1 < 8);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; 7#L61true assume !(0 != ~mode1~0 % 256); 14#L77true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 51#L77-2true ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 57#L61-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; 8#L89true assume !(0 != ~mode2~0 % 256); 56#L102true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 54#L102-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; 20#L89-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; 61#L114true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 12#L117true assume !(node3_~m3~0#1 != ~nomsg~0); 33#L117-1true ~mode3~0 := 0; 48#L114-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 36#L139true assume !(0 != ~mode4~0 % 256); 39#L152true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 22#L152-2true ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 21#L139-2true assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 72#L264true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 19#L264-1true check_#res#1 := check_~tmp~1#1; 73#L284true main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 25#L349true assume !(0 == assert_~arg#1 % 256); 38#L344true assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 10#L322-2true [2022-07-22 02:55:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-07-22 02:55:45,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:45,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134573205] [2022-07-22 02:55:45,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:55:45,967 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-22 02:55:45,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:55:45,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134573205] [2022-07-22 02:55:45,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134573205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:55:45,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:55:45,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:55:45,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842001914] [2022-07-22 02:55:45,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:55:45,976 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-22 02:55:45,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:45,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1135428887, now seen corresponding path program 1 times [2022-07-22 02:55:45,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:45,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967348205] [2022-07-22 02:55:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:55:46,114 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-22 02:55:46,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:55:46,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967348205] [2022-07-22 02:55:46,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967348205] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:55:46,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:55:46,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:55:46,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885533211] [2022-07-22 02:55:46,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:55:46,122 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:55:46,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:55:46,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:55:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:55:46,163 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 75 states have internal predecessors, (127), 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-22 02:55:46,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:55:46,311 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2022-07-22 02:55:46,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 02:55:46,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2022-07-22 02:55:46,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-22 02:55:46,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2022-07-22 02:55:46,330 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-07-22 02:55:46,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-07-22 02:55:46,331 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2022-07-22 02:55:46,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:55:46,332 INFO L369 hiAutomatonCegarLoop]: Abstraction has 113 states and 163 transitions. [2022-07-22 02:55:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2022-07-22 02:55:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2022-07-22 02:55:46,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.352112676056338) internal successors, (96), 70 states have internal predecessors, (96), 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-22 02:55:46,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-07-22 02:55:46,371 INFO L392 hiAutomatonCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-07-22 02:55:46,371 INFO L374 stractBuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-07-22 02:55:46,372 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 02:55:46,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2022-07-22 02:55:46,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-22 02:55:46,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:55:46,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:55:46,379 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:55:46,379 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, 1] [2022-07-22 02:55:46,380 INFO L752 eck$LassoCheckResult]: Stem: 281#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 273#L163 assume 0 == ~r1~0; 251#L164 assume ~id1~0 >= 0; 238#L165 assume 0 == ~st1~0; 239#L166 assume ~send1~0 == ~id1~0; 256#L167 assume 0 == ~mode1~0 % 256; 230#L168 assume ~id2~0 >= 0; 231#L169 assume 0 == ~st2~0; 285#L170 assume ~send2~0 == ~id2~0; 276#L171 assume 0 == ~mode2~0 % 256; 274#L172 assume ~id3~0 >= 0; 275#L173 assume 0 == ~st3~0; 284#L174 assume ~send3~0 == ~id3~0; 221#L175 assume 0 == ~mode3~0 % 256; 222#L176 assume ~id4~0 >= 0; 278#L177 assume 0 == ~st4~0; 262#L178 assume ~send4~0 == ~id4~0; 263#L179 assume 0 == ~mode4~0 % 256; 216#L180 assume ~id1~0 != ~id2~0; 217#L181 assume ~id1~0 != ~id3~0; 259#L182 assume ~id1~0 != ~id4~0; 260#L183 assume ~id2~0 != ~id3~0; 243#L184 assume ~id2~0 != ~id4~0; 244#L185 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 252#L163-1 init_#res#1 := init_~tmp~0#1; 253#L256 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 280#L312 assume !(0 == main_~i2~0#1); 240#L312-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 229#L322-2 [2022-07-22 02:55:46,380 INFO L754 eck$LassoCheckResult]: Loop: 229#L322-2 assume !!(main_~i2~0#1 < 8);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; 223#L61 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 224#L65 assume !(node1_~m1~0#1 != ~nomsg~0); 242#L65-1 ~mode1~0 := 0; 277#L61-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; 226#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 227#L92 assume !(node2_~m2~0#1 != ~nomsg~0); 269#L92-1 ~mode2~0 := 0; 247#L89-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; 248#L114 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 232#L117 assume !(node3_~m3~0#1 != ~nomsg~0); 233#L117-1 ~mode3~0 := 0; 261#L114-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 264#L139 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 265#L142 assume !(node4_~m4~0#1 != ~nomsg~0); 235#L142-1 ~mode4~0 := 0; 236#L139-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 249#L264 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 245#L264-1 check_#res#1 := check_~tmp~1#1; 246#L284 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 254#L349 assume !(0 == assert_~arg#1 % 256); 255#L344 assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 229#L322-2 [2022-07-22 02:55:46,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-07-22 02:55:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271304275] [2022-07-22 02:55:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:55:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,505 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:55:46,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,506 INFO L85 PathProgramCache]: Analyzing trace with hash -843208267, now seen corresponding path program 1 times [2022-07-22 02:55:46,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762649224] [2022-07-22 02:55:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:55:46,595 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-22 02:55:46,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:55:46,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762649224] [2022-07-22 02:55:46,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762649224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:55:46,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:55:46,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 02:55:46,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880697350] [2022-07-22 02:55:46,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:55:46,597 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:55:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:55:46,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 02:55:46,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 02:55:46,598 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. cyclomatic complexity: 26 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-22 02:55:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:55:46,643 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-07-22 02:55:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-22 02:55:46,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2022-07-22 02:55:46,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-22 02:55:46,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2022-07-22 02:55:46,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-22 02:55:46,651 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-07-22 02:55:46,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2022-07-22 02:55:46,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:55:46,653 INFO L369 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-22 02:55:46,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2022-07-22 02:55:46,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-22 02:55:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 70 states have internal predecessors, (93), 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-22 02:55:46,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-07-22 02:55:46,664 INFO L392 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-22 02:55:46,664 INFO L374 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-22 02:55:46,665 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 02:55:46,665 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-07-22 02:55:46,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-22 02:55:46,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:55:46,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:55:46,671 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:55:46,671 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, 1, 1, 1] [2022-07-22 02:55:46,672 INFO L752 eck$LassoCheckResult]: Stem: 438#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 429#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 430#L163 assume 0 == ~r1~0; 408#L164 assume ~id1~0 >= 0; 395#L165 assume 0 == ~st1~0; 396#L166 assume ~send1~0 == ~id1~0; 413#L167 assume 0 == ~mode1~0 % 256; 387#L168 assume ~id2~0 >= 0; 388#L169 assume 0 == ~st2~0; 442#L170 assume ~send2~0 == ~id2~0; 433#L171 assume 0 == ~mode2~0 % 256; 431#L172 assume ~id3~0 >= 0; 432#L173 assume 0 == ~st3~0; 441#L174 assume ~send3~0 == ~id3~0; 378#L175 assume 0 == ~mode3~0 % 256; 379#L176 assume ~id4~0 >= 0; 435#L177 assume 0 == ~st4~0; 419#L178 assume ~send4~0 == ~id4~0; 420#L179 assume 0 == ~mode4~0 % 256; 373#L180 assume ~id1~0 != ~id2~0; 374#L181 assume ~id1~0 != ~id3~0; 416#L182 assume ~id1~0 != ~id4~0; 417#L183 assume ~id2~0 != ~id3~0; 400#L184 assume ~id2~0 != ~id4~0; 401#L185 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 409#L163-1 init_#res#1 := init_~tmp~0#1; 410#L256 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 437#L312 assume !(0 == main_~i2~0#1); 397#L312-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 386#L322-2 [2022-07-22 02:55:46,672 INFO L754 eck$LassoCheckResult]: Loop: 386#L322-2 assume !!(main_~i2~0#1 < 8);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; 380#L61 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 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 381#L65 assume !(node1_~m1~0#1 != ~nomsg~0); 399#L65-1 ~mode1~0 := 0; 434#L61-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; 383#L89 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 384#L92 assume !(node2_~m2~0#1 != ~nomsg~0); 426#L92-1 ~mode2~0 := 0; 404#L89-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; 405#L114 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 389#L117 assume !(node3_~m3~0#1 != ~nomsg~0); 390#L117-1 ~mode3~0 := 0; 418#L114-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 421#L139 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 422#L142 assume !(node4_~m4~0#1 != ~nomsg~0); 392#L142-1 ~mode4~0 := 0; 393#L139-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 406#L264 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 375#L265 assume ~r1~0 >= 4; 376#L269 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 402#L264-1 check_#res#1 := check_~tmp~1#1; 403#L284 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 411#L349 assume !(0 == assert_~arg#1 % 256); 412#L344 assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 386#L322-2 [2022-07-22 02:55:46,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,673 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-07-22 02:55:46,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35228777] [2022-07-22 02:55:46,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,706 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:55:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:55:46,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash 9853125, now seen corresponding path program 1 times [2022-07-22 02:55:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395379350] [2022-07-22 02:55:46,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:55:46,780 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-22 02:55:46,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:55:46,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395379350] [2022-07-22 02:55:46,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395379350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:55:46,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:55:46,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:55:46,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774660163] [2022-07-22 02:55:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:55:46,782 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-22 02:55:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:55:46,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:55:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:55:46,783 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. cyclomatic complexity: 23 Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-22 02:55:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:55:46,808 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-07-22 02:55:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 02:55:46,809 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2022-07-22 02:55:46,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-22 02:55:46,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2022-07-22 02:55:46,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2022-07-22 02:55:46,813 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2022-07-22 02:55:46,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2022-07-22 02:55:46,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:55:46,815 INFO L369 hiAutomatonCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-07-22 02:55:46,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2022-07-22 02:55:46,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-22 02:55:46,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 106 states have internal predecessors, (146), 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-22 02:55:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2022-07-22 02:55:46,822 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-07-22 02:55:46,823 INFO L374 stractBuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-07-22 02:55:46,823 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 02:55:46,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2022-07-22 02:55:46,824 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-22 02:55:46,824 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 02:55:46,824 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 02:55:46,825 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 02:55:46,826 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, 1, 1, 1, 1] [2022-07-22 02:55:46,826 INFO L752 eck$LassoCheckResult]: Stem: 624#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;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0; 615#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~ret25#1, main_#t~ret26#1, main_#t~post27#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~nondet8#1;havoc main_#t~nondet8#1;~id1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~st1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~send1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~mode1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~id2~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~st2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~send2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~id3~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~send3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~mode3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~id4~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~st4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~send4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~mode4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 616#L163 assume 0 == ~r1~0; 594#L164 assume ~id1~0 >= 0; 578#L165 assume 0 == ~st1~0; 579#L166 assume ~send1~0 == ~id1~0; 598#L167 assume 0 == ~mode1~0 % 256; 570#L168 assume ~id2~0 >= 0; 571#L169 assume 0 == ~st2~0; 629#L170 assume ~send2~0 == ~id2~0; 619#L171 assume 0 == ~mode2~0 % 256; 617#L172 assume ~id3~0 >= 0; 618#L173 assume 0 == ~st3~0; 628#L174 assume ~send3~0 == ~id3~0; 567#L175 assume 0 == ~mode3~0 % 256; 568#L176 assume ~id4~0 >= 0; 622#L177 assume 0 == ~st4~0; 605#L178 assume ~send4~0 == ~id4~0; 606#L179 assume 0 == ~mode4~0 % 256; 557#L180 assume ~id1~0 != ~id2~0; 558#L181 assume ~id1~0 != ~id3~0; 602#L182 assume ~id1~0 != ~id4~0; 604#L183 assume ~id2~0 != ~id3~0; 586#L184 assume ~id2~0 != ~id4~0; 587#L185 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 595#L163-1 init_#res#1 := init_~tmp~0#1; 596#L256 main_#t~ret25#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret25#1;havoc main_#t~ret25#1; 623#L312 assume !(0 == main_~i2~0#1); 580#L312-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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 581#L322-2 [2022-07-22 02:55:46,826 INFO L754 eck$LassoCheckResult]: Loop: 581#L322-2 assume !!(main_~i2~0#1 < 8);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; 659#L61 assume !(0 != ~mode1~0 % 256); 658#L77 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite4#1 := ~send1~0; 657#L77-2 ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; 627#L61-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; 656#L89 assume !(0 != ~mode2~0 % 256); 652#L102 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 651#L102-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; 649#L89-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; 647#L114 assume !(0 != ~mode3~0 % 256); 646#L127 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 645#L127-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; 643#L114-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 642#L139 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 640#L142 assume !(node4_~m4~0#1 != ~nomsg~0); 637#L142-1 ~mode4~0 := 0; 635#L139-2 assume { :end_inline_node4 } 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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 634#L264 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 633#L265 assume !(~r1~0 >= 4); 599#L268 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 600#L269 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 584#L264-1 check_#res#1 := check_~tmp~1#1; 585#L284 main_#t~ret26#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret26#1;havoc main_#t~ret26#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; 632#L349 assume !(0 == assert_~arg#1 % 256); 660#L344 assume { :end_inline_assert } true;main_#t~post27#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post27#1;havoc main_#t~post27#1; 581#L322-2 [2022-07-22 02:55:46,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,828 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-07-22 02:55:46,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129016748] [2022-07-22 02:55:46,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,854 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:55:46,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:55:46,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1926820423, now seen corresponding path program 1 times [2022-07-22 02:55:46,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084859313] [2022-07-22 02:55:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,915 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 02:55:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 02:55:46,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 02:55:46,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:55:46,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1410036755, now seen corresponding path program 1 times [2022-07-22 02:55:46,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 02:55:46,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167937725] [2022-07-22 02:55:46,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 02:55:46,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 02:55:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:55:46,999 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-22 02:55:46,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 02:55:47,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167937725] [2022-07-22 02:55:47,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167937725] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 02:55:47,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 02:55:47,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 02:55:47,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251366382] [2022-07-22 02:55:47,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 02:55:48,030 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:55:48,031 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:55:48,031 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:55:48,031 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:55:48,031 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-22 02:55:48,031 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:55:48,032 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:55:48,032 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:55:48,032 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2022-07-22 02:55:48,032 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:55:48,032 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:55:48,055 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-22 02:55:48,062 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-22 02:55:48,067 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-22 02:55:48,072 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-22 02:55:48,074 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-22 02:55:48,076 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-22 02:55:48,080 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-22 02:55:48,085 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-22 02:55:48,087 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-22 02:55:48,089 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-22 02:55:48,093 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-22 02:55:48,098 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-22 02:55:48,101 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-22 02:55:48,107 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-22 02:55:48,109 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-22 02:55:48,284 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-22 02:55:48,816 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-07-22 02:56:07,357 WARN L233 SmtUtils]: Spent 18.40s on a formula simplification. DAG size of input: 325 DAG size of output: 173 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-07-22 02:56:07,438 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:56:07,439 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-22 02:56:07,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:07,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:07,443 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-22 02:56:07,447 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-22 02:56:07,449 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:56:07,449 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:56:07,486 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-22 02:56:07,487 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post27#1=0} Honda state: {ULTIMATE.start_main_#t~post27#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-22 02:56:07,512 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 02:56:07,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:07,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:07,515 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-22 02:56:07,517 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-22 02:56:07,518 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-22 02:56:07,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:56:07,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 02:56:07,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:07,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:07,558 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-22 02:56:07,559 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-22 02:56:07,560 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-22 02:56:07,560 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-22 02:56:07,689 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-22 02:56:07,694 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-22 02:56:07,695 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 02:56:07,695 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 02:56:07,695 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 02:56:07,695 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 02:56:07,695 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 02:56:07,695 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:07,695 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 02:56:07,695 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 02:56:07,695 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.1.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2022-07-22 02:56:07,695 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 02:56:07,695 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 02:56:07,698 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-22 02:56:07,707 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-22 02:56:07,716 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-22 02:56:07,721 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-22 02:56:07,723 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-22 02:56:07,725 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-22 02:56:07,740 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-22 02:56:07,745 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-22 02:56:07,900 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-22 02:56:07,906 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-22 02:56:07,909 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-22 02:56:07,910 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-22 02:56:07,913 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-22 02:56:07,918 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-22 02:56:07,920 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-22 02:56:07,925 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-22 02:56:08,450 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2022-07-22 02:56:26,594 WARN L233 SmtUtils]: Spent 18.08s on a formula simplification. DAG size of input: 325 DAG size of output: 173 (called from [L 68] de.uni_freiburg.informatik.ultimate.icfgtransformer.transformulatransformers.SimplifyPreprocessor.process) [2022-07-22 02:56:26,665 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 02:56:26,669 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 02:56:26,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,671 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-22 02:56:26,673 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-22 02:56:26,677 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-22 02:56:26,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:26,684 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:26,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:26,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:26,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:26,690 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:26,690 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:26,705 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:56:26,726 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-22 02:56:26,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,728 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-22 02:56:26,730 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-22 02:56:26,731 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-22 02:56:26,738 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:26,738 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:26,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:26,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:26,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:26,739 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:26,739 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:26,756 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:56:26,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 02:56:26,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,783 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-22 02:56:26,794 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-22 02:56:26,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:26,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:26,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:26,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:26,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:26,806 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:26,806 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:26,808 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-22 02:56:26,819 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:56:26,845 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-22 02:56:26,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,847 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-22 02:56:26,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 02:56:26,860 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:26,860 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:26,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:26,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:26,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:26,861 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:26,861 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:26,864 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-22 02:56:26,871 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:56:26,894 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-22 02:56:26,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,895 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-22 02:56:26,897 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-22 02:56:26,898 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-22 02:56:26,905 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:26,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:26,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:26,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:26,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:26,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:26,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:26,921 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:56:26,945 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-22 02:56:26,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,947 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-22 02:56:26,949 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-22 02:56:26,950 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-22 02:56:26,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:26,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:26,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:26,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:26,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:26,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:26,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:26,971 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 02:56:26,996 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-22 02:56:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:26,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:26,998 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-22 02:56:27,005 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-22 02:56:27,011 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 02:56:27,011 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 02:56:27,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 02:56:27,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 02:56:27,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 02:56:27,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 02:56:27,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 02:56:27,015 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-22 02:56:27,023 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 02:56:27,027 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-22 02:56:27,027 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-22 02:56:27,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 02:56:27,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 02:56:27,031 INFO L229 MonitoredProcess]: Starting monitored process 12 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-22 02:56:27,038 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 02:56:27,038 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-22 02:56:27,038 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 02:56:27,039 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-07-22 02:56:27,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 02:56:27,064 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-22 02:56:27,066 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-22 02:56:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 02:56:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:56:27,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 02:56:27,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:56:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 02:56:27,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 02:56:27,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 02:56:27,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 02:56:27,336 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-22 02:56:27,339 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-22 02:56:27,340 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40 Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-22 02:56:27,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 107 states and 146 transitions. cyclomatic complexity: 40. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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 184 states and 263 transitions. Complement of second has 4 states. [2022-07-22 02:56:27,390 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-22 02:56:27,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-22 02:56:27,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-07-22 02:56:27,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2022-07-22 02:56:27,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:56:27,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2022-07-22 02:56:27,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:56:27,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2022-07-22 02:56:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 02:56:27,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2022-07-22 02:56:27,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:56:27,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2022-07-22 02:56:27,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 02:56:27,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 02:56:27,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 02:56:27,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:56:27,401 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:56:27,401 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:56:27,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 02:56:27,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 02:56:27,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 02:56:27,403 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-22 02:56:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 02:56:27,403 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-22 02:56:27,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 02:56:27,405 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-22 02:56:27,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:56:27,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 02:56:27,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-22 02:56:27,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-22 02:56:27,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-22 02:56:27,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 02:56:27,406 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:56:27,406 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:56:27,406 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 02:56:27,406 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 02:56:27,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-22 02:56:27,407 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-22 02:56:27,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-22 02:56:27,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 02:56:27 BoogieIcfgContainer [2022-07-22 02:56:27,415 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 02:56:27,416 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 02:56:27,416 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 02:56:27,416 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 02:56:27,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:55:45" (3/4) ... [2022-07-22 02:56:27,419 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 02:56:27,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 02:56:27,420 INFO L158 Benchmark]: Toolchain (without parser) took 42830.74ms. Allocated memory was 48.2MB in the beginning and 104.9MB in the end (delta: 56.6MB). Free memory was 23.5MB in the beginning and 61.0MB in the end (delta: -37.5MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2022-07-22 02:56:27,422 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.2MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:56:27,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.66ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.2MB in the beginning and 39.8MB in the end (delta: -16.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. [2022-07-22 02:56:27,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.94ms. Allocated memory is still 58.7MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:56:27,428 INFO L158 Benchmark]: Boogie Preprocessor took 49.43ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 35.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 02:56:27,429 INFO L158 Benchmark]: RCFGBuilder took 499.47ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 32.0MB in the end (delta: 3.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. [2022-07-22 02:56:27,429 INFO L158 Benchmark]: BuchiAutomizer took 41870.63ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 32.0MB in the beginning and 62.0MB in the end (delta: -30.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. [2022-07-22 02:56:27,429 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 104.9MB. Free memory was 62.0MB in the beginning and 61.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 02:56:27,431 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.33ms. Allocated memory is still 48.2MB. Free memory was 30.3MB in the beginning and 30.2MB in the end (delta: 31.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.66ms. Allocated memory was 48.2MB in the beginning and 58.7MB in the end (delta: 10.5MB). Free memory was 23.2MB in the beginning and 39.8MB in the end (delta: -16.6MB). Peak memory consumption was 3.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.94ms. Allocated memory is still 58.7MB. Free memory was 39.6MB in the beginning and 37.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.43ms. Allocated memory is still 58.7MB. Free memory was 37.5MB in the beginning and 35.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 499.47ms. Allocated memory is still 58.7MB. Free memory was 35.9MB in the beginning and 32.0MB in the end (delta: 3.8MB). Peak memory consumption was 12.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 41870.63ms. Allocated memory was 58.7MB in the beginning and 104.9MB in the end (delta: 46.1MB). Free memory was 32.0MB in the beginning and 62.0MB in the end (delta: -30.0MB). Peak memory consumption was 16.0MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 104.9MB. Free memory was 62.0MB in the beginning and 61.0MB in the end (delta: 1.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 15 + -2 * i2 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 41.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 40.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 42 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, 279 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 278 mSDsluCounter, 1195 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 443 mSDtfsCounter, 46 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital197 mio100 ax100 hnf100 lsp84 ukn76 mio100 lsp100 div172 bol100 ite100 ukn100 eq164 hnf94 smp71 dnf16751 smp27 tf100 neg97 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-22 02:56:27,452 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