./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f4b24e32 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.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 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 16:16:31,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 16:16:31,361 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 16:16:31,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 16:16:31,397 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 16:16:31,398 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 16:16:31,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 16:16:31,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 16:16:31,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 16:16:31,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 16:16:31,407 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 16:16:31,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 16:16:31,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 16:16:31,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 16:16:31,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 16:16:31,414 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 16:16:31,415 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 16:16:31,415 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 16:16:31,416 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 16:16:31,417 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 16:16:31,418 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 16:16:31,419 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 16:16:31,419 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 16:16:31,420 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 16:16:31,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 16:16:31,424 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 16:16:31,426 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 16:16:31,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 16:16:31,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 16:16:31,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 16:16:31,428 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 16:16:31,428 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 16:16:31,429 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 16:16:31,430 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 16:16:31,430 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 16:16:31,431 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 16:16:31,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 16:16:31,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 16:16:31,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 16:16:31,432 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 16:16:31,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 16:16:31,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 16:16:31,434 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-07-14 16:16:31,451 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 16:16:31,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 16:16:31,452 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 16:16:31,452 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 16:16:31,453 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 16:16:31,453 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 16:16:31,453 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 16:16:31,453 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 16:16:31,453 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 16:16:31,454 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 16:16:31,454 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 16:16:31,454 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 16:16:31,455 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 16:16:31,455 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 16:16:31,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 16:16:31,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 16:16:31,456 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 16:16:31,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 16:16:31,457 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 16:16:31,458 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 16:16:31,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 16:16:31,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 16:16:31,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 16:16:31,458 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 16:16:31,458 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 16:16:31,459 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 16:16:31,459 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 -> 9a8265a1502e23b0364b9cd16198377a0ca498fc346156a58eeb954c0e23f901 [2022-07-14 16:16:31,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 16:16:31,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 16:16:31,681 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 16:16:31,681 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 16:16:31,682 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 16:16:31,683 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2022-07-14 16:16:31,735 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb02eae1/b6168921ef9c456d912bce3b3b9575d6/FLAG9225dc6b5 [2022-07-14 16:16:32,106 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 16:16:32,107 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.4.ufo.BOUNDED-8.pals.c [2022-07-14 16:16:32,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb02eae1/b6168921ef9c456d912bce3b3b9575d6/FLAG9225dc6b5 [2022-07-14 16:16:32,121 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6eb02eae1/b6168921ef9c456d912bce3b3b9575d6 [2022-07-14 16:16:32,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 16:16:32,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 16:16:32,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 16:16:32,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 16:16:32,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 16:16:32,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44eb715d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32, skipping insertion in model container [2022-07-14 16:16:32,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 16:16:32,152 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 16:16:32,298 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.ufo.BOUNDED-8.pals.c[8209,8222] [2022-07-14 16:16:32,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:16:32,304 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 16:16:32,336 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.ufo.BOUNDED-8.pals.c[8209,8222] [2022-07-14 16:16:32,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 16:16:32,345 INFO L208 MainTranslator]: Completed translation [2022-07-14 16:16:32,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32 WrapperNode [2022-07-14 16:16:32,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 16:16:32,346 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 16:16:32,347 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 16:16:32,347 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 16:16:32,354 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,381 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 259 [2022-07-14 16:16:32,382 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 16:16:32,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 16:16:32,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 16:16:32,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 16:16:32,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,408 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 16:16:32,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 16:16:32,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 16:16:32,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 16:16:32,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (1/1) ... [2022-07-14 16:16:32,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:32,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:32,443 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-14 16:16:32,445 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-14 16:16:32,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 16:16:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 16:16:32,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 16:16:32,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 16:16:32,557 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 16:16:32,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 16:16:32,774 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 16:16:32,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 16:16:32,779 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 16:16:32,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:16:32 BoogieIcfgContainer [2022-07-14 16:16:32,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 16:16:32,781 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 16:16:32,781 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 16:16:32,783 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 16:16:32,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:16:32,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 04:16:32" (1/3) ... [2022-07-14 16:16:32,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32a0f68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:16:32, skipping insertion in model container [2022-07-14 16:16:32,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:16:32,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:16:32" (2/3) ... [2022-07-14 16:16:32,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32a0f68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 04:16:32, skipping insertion in model container [2022-07-14 16:16:32,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 16:16:32,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:16:32" (3/3) ... [2022-07-14 16:16:32,786 INFO L354 chiAutomizerObserver]: Analyzing ICFG pals_lcr.4.ufo.BOUNDED-8.pals.c [2022-07-14 16:16:32,820 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 16:16:32,821 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 16:16:32,821 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 16:16:32,821 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 16:16:32,821 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 16:16:32,821 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 16:16:32,821 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 16:16:32,821 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 16:16:32,831 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-14 16:16:32,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-07-14 16:16:32,845 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:16:32,845 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:16:32,852 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:16:32,852 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-14 16:16:32,852 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 16:16:32,853 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-14 16:16:32,861 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 43 [2022-07-14 16:16:32,861 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:16:32,861 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:16:32,862 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 16:16:32,862 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-14 16:16:32,867 INFO L752 eck$LassoCheckResult]: Stem: 53#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(32, 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; 42#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; 16#L161true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 9#L161-1true init_#res#1 := init_~tmp~0#1; 57#L254true 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; 11#L310true assume !(0 == main_~i2~0#1); 4#L310-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; 17#L320-2true [2022-07-14 16:16:32,868 INFO L754 eck$LassoCheckResult]: Loop: 17#L320-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; 6#L61true 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; 75#L65true assume !(node1_~m1~0#1 != ~nomsg~0); 59#L65-1true ~mode1~0 := 0; 49#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; 61#L87true assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 60#L90true assume !(node2_~m2~0#1 != ~nomsg~0); 25#L90-1true ~mode2~0 := 0; 8#L87-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; 56#L112true assume !(0 != ~mode3~0 % 256); 21#L125true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 13#L125-2true ~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; 67#L112-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; 74#L137true assume !(0 != ~mode4~0 % 256); 33#L150true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 22#L150-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; 50#L137-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; 68#L262true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 28#L262-1true check_#res#1 := check_~tmp~1#1; 5#L282true 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; 48#L347true assume !(0 == assert_~arg#1 % 256); 39#L342true 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; 17#L320-2true [2022-07-14 16:16:32,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1932780748, now seen corresponding path program 1 times [2022-07-14 16:16:32,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:32,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759720875] [2022-07-14 16:16:32,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:32,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:33,030 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-14 16:16:33,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:16:33,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759720875] [2022-07-14 16:16:33,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759720875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:16:33,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:16:33,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:16:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992525619] [2022-07-14 16:16:33,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:16:33,039 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 16:16:33,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,040 INFO L85 PathProgramCache]: Analyzing trace with hash 712570273, now seen corresponding path program 1 times [2022-07-14 16:16:33,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614175036] [2022-07-14 16:16:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:33,151 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-14 16:16:33,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:16:33,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614175036] [2022-07-14 16:16:33,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614175036] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:16:33,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:16:33,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:16:33,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082488663] [2022-07-14 16:16:33,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:16:33,153 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:16:33,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:16:33,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:16:33,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:16:33,182 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-14 16:16:33,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:16:33,264 INFO L93 Difference]: Finished difference Result 122 states and 194 transitions. [2022-07-14 16:16:33,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 16:16:33,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 122 states and 194 transitions. [2022-07-14 16:16:33,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-14 16:16:33,278 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 122 states to 113 states and 163 transitions. [2022-07-14 16:16:33,279 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 113 [2022-07-14 16:16:33,280 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 113 [2022-07-14 16:16:33,280 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 163 transitions. [2022-07-14 16:16:33,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:16:33,281 INFO L369 hiAutomatonCegarLoop]: Abstraction has 113 states and 163 transitions. [2022-07-14 16:16:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 163 transitions. [2022-07-14 16:16:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 71. [2022-07-14 16:16:33,299 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-14 16:16:33,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-07-14 16:16:33,300 INFO L392 hiAutomatonCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-07-14 16:16:33,300 INFO L374 stractBuchiCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-07-14 16:16:33,300 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 16:16:33,300 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 96 transitions. [2022-07-14 16:16:33,301 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-14 16:16:33,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:16:33,302 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:16:33,302 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-14 16:16:33,302 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-14 16:16:33,303 INFO L752 eck$LassoCheckResult]: Stem: 278#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(32, 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; 268#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; 243#L161 assume 0 == ~r1~0; 244#L162 assume ~id1~0 >= 0; 264#L163 assume 0 == ~st1~0; 247#L164 assume ~send1~0 == ~id1~0; 238#L165 assume 0 == ~mode1~0 % 256; 239#L166 assume ~id2~0 >= 0; 251#L167 assume 0 == ~st2~0; 229#L168 assume ~send2~0 == ~id2~0; 230#L169 assume 0 == ~mode2~0 % 256; 286#L170 assume ~id3~0 >= 0; 271#L171 assume 0 == ~st3~0; 269#L172 assume ~send3~0 == ~id3~0; 270#L173 assume 0 == ~mode3~0 % 256; 282#L174 assume ~id4~0 >= 0; 222#L175 assume 0 == ~st4~0; 223#L176 assume ~send4~0 == ~id4~0; 272#L177 assume 0 == ~mode4~0 % 256; 261#L178 assume ~id1~0 != ~id2~0; 262#L179 assume ~id1~0 != ~id3~0; 216#L180 assume ~id1~0 != ~id4~0; 217#L181 assume ~id2~0 != ~id3~0; 256#L182 assume ~id2~0 != ~id4~0; 257#L183 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 231#L161-1 init_#res#1 := init_~tmp~0#1; 232#L254 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; 233#L310 assume !(0 == main_~i2~0#1); 218#L310-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; 219#L320-2 [2022-07-14 16:16:33,303 INFO L754 eck$LassoCheckResult]: Loop: 219#L320-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; 224#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; 225#L65 assume !(node1_~m1~0#1 != ~nomsg~0); 246#L65-1 ~mode1~0 := 0; 274#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; 275#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 280#L90 assume !(node2_~m2~0#1 != ~nomsg~0); 252#L90-1 ~mode2~0 := 0; 227#L87-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; 228#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 279#L115 assume !(node3_~m3~0#1 != ~nomsg~0); 259#L115-1 ~mode3~0 := 0; 237#L112-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; 284#L137 assume !(0 != ~mode4~0 % 256); 263#L150 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 249#L150-2 ~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; 250#L137-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; 276#L262 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 241#L262-1 check_#res#1 := check_~tmp~1#1; 220#L282 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; 221#L347 assume !(0 == assert_~arg#1 % 256); 266#L342 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; 219#L320-2 [2022-07-14 16:16:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,304 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 1 times [2022-07-14 16:16:33,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680070901] [2022-07-14 16:16:33,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,320 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:16:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,363 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:16:33,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,364 INFO L85 PathProgramCache]: Analyzing trace with hash 374777131, now seen corresponding path program 1 times [2022-07-14 16:16:33,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138522877] [2022-07-14 16:16:33,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:33,434 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-14 16:16:33,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:16:33,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138522877] [2022-07-14 16:16:33,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138522877] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:16:33,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:16:33,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 16:16:33,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054241252] [2022-07-14 16:16:33,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:16:33,436 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:16:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:16:33,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 16:16:33,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 16:16:33,437 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-14 16:16:33,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:16:33,467 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2022-07-14 16:16:33,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 16:16:33,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 98 transitions. [2022-07-14 16:16:33,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-14 16:16:33,470 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 71 states and 93 transitions. [2022-07-14 16:16:33,470 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 71 [2022-07-14 16:16:33,471 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-07-14 16:16:33,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 93 transitions. [2022-07-14 16:16:33,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:16:33,471 INFO L369 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-14 16:16:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 93 transitions. [2022-07-14 16:16:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-14 16:16:33,474 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-14 16:16:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2022-07-14 16:16:33,474 INFO L392 hiAutomatonCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-14 16:16:33,474 INFO L374 stractBuchiCegarLoop]: Abstraction has 71 states and 93 transitions. [2022-07-14 16:16:33,475 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 16:16:33,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 71 states and 93 transitions. [2022-07-14 16:16:33,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 42 [2022-07-14 16:16:33,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:16:33,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:16:33,476 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-14 16:16:33,476 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-14 16:16:33,477 INFO L752 eck$LassoCheckResult]: Stem: 435#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(32, 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; 425#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; 399#L161 assume 0 == ~r1~0; 400#L162 assume ~id1~0 >= 0; 421#L163 assume 0 == ~st1~0; 403#L164 assume ~send1~0 == ~id1~0; 395#L165 assume 0 == ~mode1~0 % 256; 396#L166 assume ~id2~0 >= 0; 407#L167 assume 0 == ~st2~0; 386#L168 assume ~send2~0 == ~id2~0; 387#L169 assume 0 == ~mode2~0 % 256; 443#L170 assume ~id3~0 >= 0; 428#L171 assume 0 == ~st3~0; 426#L172 assume ~send3~0 == ~id3~0; 427#L173 assume 0 == ~mode3~0 % 256; 439#L174 assume ~id4~0 >= 0; 379#L175 assume 0 == ~st4~0; 380#L176 assume ~send4~0 == ~id4~0; 429#L177 assume 0 == ~mode4~0 % 256; 418#L178 assume ~id1~0 != ~id2~0; 419#L179 assume ~id1~0 != ~id3~0; 373#L180 assume ~id1~0 != ~id4~0; 374#L181 assume ~id2~0 != ~id3~0; 413#L182 assume ~id2~0 != ~id4~0; 414#L183 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 388#L161-1 init_#res#1 := init_~tmp~0#1; 389#L254 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; 390#L310 assume !(0 == main_~i2~0#1); 375#L310-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; 376#L320-2 [2022-07-14 16:16:33,477 INFO L754 eck$LassoCheckResult]: Loop: 376#L320-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; 381#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; 382#L65 assume !(node1_~m1~0#1 != ~nomsg~0); 402#L65-1 ~mode1~0 := 0; 431#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; 432#L87 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 437#L90 assume !(node2_~m2~0#1 != ~nomsg~0); 408#L90-1 ~mode2~0 := 0; 384#L87-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; 385#L112 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 436#L115 assume !(node3_~m3~0#1 != ~nomsg~0); 416#L115-1 ~mode3~0 := 0; 394#L112-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; 441#L137 assume !(0 != ~mode4~0 % 256); 420#L150 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 405#L150-2 ~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; 406#L137-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; 433#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 442#L263 assume ~r1~0 >= 4; 398#L267 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 411#L262-1 check_#res#1 := check_~tmp~1#1; 377#L282 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; 378#L347 assume !(0 == assert_~arg#1 % 256); 423#L342 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; 376#L320-2 [2022-07-14 16:16:33,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,477 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 2 times [2022-07-14 16:16:33,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823901122] [2022-07-14 16:16:33,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:16:33,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:16:33,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2032251205, now seen corresponding path program 1 times [2022-07-14 16:16:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296117802] [2022-07-14 16:16:33,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:33,586 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-14 16:16:33,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:16:33,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296117802] [2022-07-14 16:16:33,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296117802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:16:33,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:16:33,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:16:33,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61555429] [2022-07-14 16:16:33,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:16:33,587 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 16:16:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:16:33,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:16:33,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:16:33,588 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-14 16:16:33,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:16:33,607 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-07-14 16:16:33,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 16:16:33,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 107 states and 146 transitions. [2022-07-14 16:16:33,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-14 16:16:33,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 107 states to 107 states and 146 transitions. [2022-07-14 16:16:33,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 107 [2022-07-14 16:16:33,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 107 [2022-07-14 16:16:33,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 146 transitions. [2022-07-14 16:16:33,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:16:33,611 INFO L369 hiAutomatonCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-07-14 16:16:33,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 146 transitions. [2022-07-14 16:16:33,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-14 16:16:33,614 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-14 16:16:33,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2022-07-14 16:16:33,615 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-07-14 16:16:33,615 INFO L374 stractBuchiCegarLoop]: Abstraction has 107 states and 146 transitions. [2022-07-14 16:16:33,615 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 16:16:33,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states and 146 transitions. [2022-07-14 16:16:33,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-07-14 16:16:33,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 16:16:33,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 16:16:33,617 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-14 16:16:33,617 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-14 16:16:33,617 INFO L752 eck$LassoCheckResult]: Stem: 621#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(32, 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; 611#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; 583#L161 assume 0 == ~r1~0; 584#L162 assume ~id1~0 >= 0; 607#L163 assume 0 == ~st1~0; 587#L164 assume ~send1~0 == ~id1~0; 581#L165 assume 0 == ~mode1~0 % 256; 582#L166 assume ~id2~0 >= 0; 591#L167 assume 0 == ~st2~0; 570#L168 assume ~send2~0 == ~id2~0; 571#L169 assume 0 == ~mode2~0 % 256; 631#L170 assume ~id3~0 >= 0; 614#L171 assume 0 == ~st3~0; 612#L172 assume ~send3~0 == ~id3~0; 613#L173 assume 0 == ~mode3~0 % 256; 626#L174 assume ~id4~0 >= 0; 566#L175 assume 0 == ~st4~0; 567#L176 assume ~send4~0 == ~id4~0; 615#L177 assume 0 == ~mode4~0 % 256; 603#L178 assume ~id1~0 != ~id2~0; 604#L179 assume ~id1~0 != ~id3~0; 557#L180 assume ~id1~0 != ~id4~0; 558#L181 assume ~id2~0 != ~id3~0; 598#L182 assume ~id2~0 != ~id4~0; 602#L183 assume ~id3~0 != ~id4~0;init_~tmp~0#1 := 1; 572#L161-1 init_#res#1 := init_~tmp~0#1; 573#L254 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; 574#L310 assume !(0 == main_~i2~0#1); 559#L310-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; 560#L320-2 [2022-07-14 16:16:33,617 INFO L754 eck$LassoCheckResult]: Loop: 560#L320-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; 563#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; 564#L65 assume !(node1_~m1~0#1 != ~nomsg~0); 586#L65-1 ~mode1~0 := 0; 617#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; 618#L87 assume !(0 != ~mode2~0 % 256); 624#L100 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 608#L100-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; 568#L87-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; 569#L112 assume !(0 != ~mode3~0 % 256); 588#L125 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 577#L125-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; 578#L112-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#L137 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 640#L140 assume !(node4_~m4~0#1 != ~nomsg~0); 637#L140-1 ~mode4~0 := 0; 635#L137-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#L262 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 633#L263 assume !(~r1~0 >= 4); 579#L266 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 580#L267 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 597#L262-1 check_#res#1 := check_~tmp~1#1; 561#L282 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; 562#L347 assume !(0 == assert_~arg#1 % 256); 609#L342 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; 560#L320-2 [2022-07-14 16:16:33,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,618 INFO L85 PathProgramCache]: Analyzing trace with hash -24004505, now seen corresponding path program 3 times [2022-07-14 16:16:33,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252211786] [2022-07-14 16:16:33,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:16:33,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,654 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:16:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,659 INFO L85 PathProgramCache]: Analyzing trace with hash 452535279, now seen corresponding path program 1 times [2022-07-14 16:16:33,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538478187] [2022-07-14 16:16:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,670 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 16:16:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 16:16:33,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 16:16:33,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:33,681 INFO L85 PathProgramCache]: Analyzing trace with hash -505574839, now seen corresponding path program 1 times [2022-07-14 16:16:33,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 16:16:33,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525092637] [2022-07-14 16:16:33,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 16:16:33,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 16:16:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:33,714 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-14 16:16:33,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 16:16:33,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525092637] [2022-07-14 16:16:33,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525092637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 16:16:33,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 16:16:33,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 16:16:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397286656] [2022-07-14 16:16:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 16:16:34,395 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:16:34,396 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:16:34,396 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:16:34,397 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:16:34,397 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 16:16:34,397 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:34,397 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:16:34,397 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:16:34,397 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2022-07-14 16:16:34,397 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:16:34,397 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:16:34,411 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-14 16:16:34,416 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-14 16:16:34,419 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-14 16:16:34,422 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-14 16:16:34,423 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-14 16:16:34,432 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-14 16:16:34,435 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-14 16:16:34,439 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-14 16:16:34,445 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-14 16:16:34,447 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-14 16:16:34,449 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-14 16:16:34,546 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-14 16:16:34,550 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-14 16:16:34,552 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-14 16:16:34,555 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-14 16:16:34,557 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-14 16:16:34,940 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-07-14 16:16:38,082 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:16:38,083 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 16:16:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:38,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:38,086 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-14 16:16:38,093 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:16:38,093 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:16:38,103 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-14 16:16:38,131 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 16:16:38,131 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-14 16:16:38,149 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-14 16:16:38,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:38,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:38,151 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-14 16:16:38,153 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-14 16:16:38,163 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 16:16:38,163 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:16:38,216 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-14 16:16:38,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:38,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:38,218 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-14 16:16:38,223 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-14 16:16:38,226 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 16:16:38,226 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 16:16:38,327 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 16:16:38,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-07-14 16:16:38,332 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 16:16:38,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 16:16:38,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 16:16:38,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 16:16:38,333 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 16:16:38,333 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:38,333 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 16:16:38,333 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 16:16:38,333 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.4.ufo.BOUNDED-8.pals.c_Iteration4_Loop [2022-07-14 16:16:38,333 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 16:16:38,333 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 16:16:38,335 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-14 16:16:38,350 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-14 16:16:38,352 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-14 16:16:38,355 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-14 16:16:38,357 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-14 16:16:38,366 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-14 16:16:38,369 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-14 16:16:38,462 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-14 16:16:38,468 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-14 16:16:38,470 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-14 16:16:38,471 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-14 16:16:38,473 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-14 16:16:38,475 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-14 16:16:38,478 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-14 16:16:38,480 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-14 16:16:38,485 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-14 16:16:38,892 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2022-07-14 16:16:41,873 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 16:16:41,876 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 16:16:41,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:41,878 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-14 16:16:41,879 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-14 16:16:41,880 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-14 16:16:41,886 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:16:41,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:16:41,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:16:41,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:16:41,886 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:16:41,888 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:16:41,888 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:16:41,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:16:41,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-14 16:16:41,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:41,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:41,924 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-14 16:16:41,925 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-14 16:16:41,926 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-14 16:16:41,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:16:41,930 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:16:41,931 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:16:41,931 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:16:41,931 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:16:41,931 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:16:41,931 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:16:41,947 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:16:41,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-14 16:16:41,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:41,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:41,963 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-14 16:16:41,964 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-14 16:16:41,965 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-14 16:16:41,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:16:41,970 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:16:41,970 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:16:41,970 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:16:41,970 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:16:41,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:16:41,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:16:41,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:16:41,991 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-14 16:16:41,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:41,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:41,996 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-14 16:16:41,997 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-14 16:16:41,997 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-14 16:16:42,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:16:42,003 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:16:42,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:16:42,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:16:42,003 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:16:42,005 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:16:42,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:16:42,006 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:16:42,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-07-14 16:16:42,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:42,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:42,022 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-14 16:16:42,023 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-14 16:16:42,024 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-14 16:16:42,029 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:16:42,029 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:16:42,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:16:42,029 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-07-14 16:16:42,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:16:42,031 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-07-14 16:16:42,031 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:16:42,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 16:16:42,075 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-14 16:16:42,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:42,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:42,078 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-14 16:16:42,080 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-14 16:16:42,081 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-14 16:16:42,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 16:16:42,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 16:16:42,087 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 16:16:42,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 16:16:42,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 16:16:42,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 16:16:42,088 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 16:16:42,099 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 16:16:42,116 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 16:16:42,117 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 16:16:42,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 16:16:42,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 16:16:42,119 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-14 16:16:42,121 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-14 16:16:42,122 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 16:16:42,122 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 16:16:42,122 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 16:16:42,123 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-14 16:16:42,141 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-14 16:16:42,142 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 16:16:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 16:16:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:42,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 16:16:42,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:16:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 16:16:42,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 16:16:42,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 16:16:42,363 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-14 16:16:42,371 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-14 16:16:42,374 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-14 16:16:42,375 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-14 16:16:42,418 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-14 16:16:42,418 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-14 16:16:42,420 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-14 16:16:42,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-07-14 16:16:42,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 25 letters. [2022-07-14 16:16:42,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:16:42,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 54 letters. Loop has 25 letters. [2022-07-14 16:16:42,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:16:42,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 93 transitions. Stem has 29 letters. Loop has 50 letters. [2022-07-14 16:16:42,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 16:16:42,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 263 transitions. [2022-07-14 16:16:42,428 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:16:42,428 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 0 states and 0 transitions. [2022-07-14 16:16:42,428 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:16:42,428 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:16:42,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:16:42,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:16:42,429 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:16:42,429 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:16:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 16:16:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 16:16:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 16:16:42,430 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-14 16:16:42,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 16:16:42,430 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-07-14 16:16:42,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 16:16:42,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-07-14 16:16:42,432 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:16:42,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 16:16:42,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 16:16:42,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 16:16:42,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 16:16:42,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 16:16:42,432 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:16:42,432 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:16:42,433 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 16:16:42,433 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 16:16:42,433 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 16:16:42,433 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 16:16:42,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 16:16:42,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 04:16:42 BoogieIcfgContainer [2022-07-14 16:16:42,444 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 16:16:42,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 16:16:42,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 16:16:42,444 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 16:16:42,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:16:32" (3/4) ... [2022-07-14 16:16:42,447 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 16:16:42,447 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 16:16:42,448 INFO L158 Benchmark]: Toolchain (without parser) took 10323.80ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 77.1MB in the beginning and 109.9MB in the end (delta: -32.9MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-07-14 16:16:42,448 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 77.6MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:16:42,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.23ms. Allocated memory is still 102.8MB. Free memory was 76.8MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 16:16:42,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.49ms. Allocated memory is still 102.8MB. Free memory was 74.1MB in the beginning and 71.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:16:42,451 INFO L158 Benchmark]: Boogie Preprocessor took 28.23ms. Allocated memory is still 102.8MB. Free memory was 71.9MB in the beginning and 70.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 16:16:42,454 INFO L158 Benchmark]: RCFGBuilder took 367.79ms. Allocated memory is still 102.8MB. Free memory was 70.1MB in the beginning and 53.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-14 16:16:42,456 INFO L158 Benchmark]: BuchiAutomizer took 9662.85ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 53.3MB in the beginning and 109.9MB in the end (delta: -56.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:16:42,456 INFO L158 Benchmark]: Witness Printer took 3.22ms. Allocated memory is still 151.0MB. Free memory is still 109.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 16:16:42,457 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.14ms. Allocated memory is still 77.6MB. Free memory is still 39.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.23ms. Allocated memory is still 102.8MB. Free memory was 76.8MB in the beginning and 74.1MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.49ms. Allocated memory is still 102.8MB. Free memory was 74.1MB in the beginning and 71.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.23ms. Allocated memory is still 102.8MB. Free memory was 71.9MB in the beginning and 70.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 367.79ms. Allocated memory is still 102.8MB. Free memory was 70.1MB in the beginning and 53.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 9662.85ms. Allocated memory was 102.8MB in the beginning and 151.0MB in the end (delta: 48.2MB). Free memory was 53.3MB in the beginning and 109.9MB in the end (delta: -56.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.22ms. Allocated memory is still 151.0MB. Free memory is still 109.9MB. 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 9.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 9.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 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.0s 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 lsp64 ukn79 mio100 lsp100 div160 bol100 ite100 ukn100 eq170 hnf93 smp74 dnf2921 smp41 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 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-14 16:16:42,485 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