./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/circular_buffer_ok.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i ./goblint.2024-05-21_14-57-05.files/protection/circular_buffer_ok.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 11:44:36,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:44:36,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:44:36,414 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:44:36,415 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:44:36,437 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:44:36,438 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:44:36,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:44:36,439 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:44:36,442 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:44:36,442 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:44:36,442 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:44:36,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:44:36,444 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:44:36,444 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:44:36,445 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:44:36,445 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:44:36,445 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:44:36,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:44:36,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:44:36,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:44:36,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:44:36,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:44:36,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:44:36,447 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:44:36,447 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:44:36,448 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:44:36,448 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:44:36,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:44:36,449 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:44:36,450 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:44:36,450 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:44:36,450 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:44:36,450 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:44:36,450 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:44:36,451 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:44:36,451 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:44:36,451 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:44:36,451 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:44:36,451 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:44:36,451 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:44:36,452 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:44:36,452 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:44:36,452 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 11:44:36,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:44:36,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:44:36,649 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:44:36,650 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:44:36,651 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:44:36,652 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-14 11:44:37,736 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:44:37,953 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:44:37,954 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2024-06-14 11:44:37,966 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243984cb2/9828e72199ca453c942c28626a9900a2/FLAGbb9ffba21 [2024-06-14 11:44:37,975 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/243984cb2/9828e72199ca453c942c28626a9900a2 [2024-06-14 11:44:37,977 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:44:37,978 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:44:37,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/circular_buffer_ok.yml/witness.yml [2024-06-14 11:44:38,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:44:38,052 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:44:38,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:44:38,053 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:44:38,056 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:44:38,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:44:37" (1/2) ... [2024-06-14 11:44:38,058 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f658807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:44:38, skipping insertion in model container [2024-06-14 11:44:38,058 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:44:37" (1/2) ... [2024-06-14 11:44:38,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@745dff67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:44:38, skipping insertion in model container [2024-06-14 11:44:38,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:44:38" (2/2) ... [2024-06-14 11:44:38,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f658807 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38, skipping insertion in model container [2024-06-14 11:44:38,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:44:38" (2/2) ... [2024-06-14 11:44:38,061 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:44:38,084 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:44:38,085 INFO L97 edCorrectnessWitness]: Location invariant before [L764-L764] ! multithreaded || (0 <= value && value <= 6) [2024-06-14 11:44:38,086 INFO L97 edCorrectnessWitness]: Location invariant before [L765-L765] ! multithreaded || (0 <= value && value <= 6) [2024-06-14 11:44:38,086 INFO L103 edCorrectnessWitness]: ghost_variable m_locked = 0 [2024-06-14 11:44:38,086 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:44:38,086 INFO L106 edCorrectnessWitness]: ghost_update [L745-L745] m_locked = 1; [2024-06-14 11:44:38,086 INFO L106 edCorrectnessWitness]: ghost_update [L763-L763] multithreaded = 1; [2024-06-14 11:44:38,086 INFO L106 edCorrectnessWitness]: ghost_update [L727-L727] m_locked = 1; [2024-06-14 11:44:38,086 INFO L106 edCorrectnessWitness]: ghost_update [L736-L736] m_locked = 0; [2024-06-14 11:44:38,087 INFO L106 edCorrectnessWitness]: ghost_update [L753-L753] m_locked = 0; [2024-06-14 11:44:38,126 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:44:38,425 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:44:38,438 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 11:44:38,513 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:44:38,547 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:44:38,548 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38 WrapperNode [2024-06-14 11:44:38,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:44:38,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:44:38,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:44:38,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:44:38,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,603 INFO L138 Inliner]: procedures = 168, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-06-14 11:44:38,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:44:38,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:44:38,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:44:38,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:44:38,613 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,615 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,626 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 1, 3, 8]. 57 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 0, 8]. The 2 writes are split as follows [0, 0, 2, 0]. [2024-06-14 11:44:38,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,641 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:44:38,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:44:38,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:44:38,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:44:38,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (1/1) ... [2024-06-14 11:44:38,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:44:38,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:44:38,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-14 11:44:38,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-14 11:44:38,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-14 11:44:38,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-14 11:44:38,742 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-14 11:44:38,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:44:38,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:44:38,744 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:44:38,862 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:44:38,864 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:44:39,109 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:44:39,110 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:44:39,307 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:44:39,307 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-14 11:44:39,309 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:44:39 BoogieIcfgContainer [2024-06-14 11:44:39,309 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:44:39,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:44:39,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:44:39,313 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:44:39,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:44:37" (1/4) ... [2024-06-14 11:44:39,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fad108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:44:39, skipping insertion in model container [2024-06-14 11:44:39,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:44:38" (2/4) ... [2024-06-14 11:44:39,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fad108 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:44:39, skipping insertion in model container [2024-06-14 11:44:39,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:44:38" (3/4) ... [2024-06-14 11:44:39,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43fad108 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:44:39, skipping insertion in model container [2024-06-14 11:44:39,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:44:39" (4/4) ... [2024-06-14 11:44:39,316 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2024-06-14 11:44:39,330 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:44:39,331 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 11:44:39,331 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:44:39,401 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-14 11:44:39,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 30 transitions, 74 flow [2024-06-14 11:44:39,452 INFO L124 PetriNetUnfolderBase]: 2/28 cut-off events. [2024-06-14 11:44:39,453 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-14 11:44:39,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 28 events. 2/28 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 41 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-06-14 11:44:39,455 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 30 transitions, 74 flow [2024-06-14 11:44:39,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 26 transitions, 61 flow [2024-06-14 11:44:39,466 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:44:39,473 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c2f519c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:44:39,473 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-06-14 11:44:39,477 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:44:39,477 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-14 11:44:39,477 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:44:39,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:44:39,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-14 11:44:39,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:44:39,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:44:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash -300262953, now seen corresponding path program 1 times [2024-06-14 11:44:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:44:39,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216383850] [2024-06-14 11:44:39,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:39,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:44:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:44:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:44:39,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:44:39,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216383850] [2024-06-14 11:44:39,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216383850] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:44:39,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:44:39,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:44:39,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428983237] [2024-06-14 11:44:39,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:44:39,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:44:39,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:44:39,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:44:39,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:44:39,807 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 11:44:39,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-06-14 11:44:39,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:44:39,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 11:44:39,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:44:39,992 INFO L124 PetriNetUnfolderBase]: 267/482 cut-off events. [2024-06-14 11:44:39,992 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-14 11:44:39,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 970 conditions, 482 events. 267/482 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1969 event pairs, 95 based on Foata normal form. 24/499 useless extension candidates. Maximal degree in co-relation 895. Up to 308 conditions per place. [2024-06-14 11:44:39,998 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 32 selfloop transitions, 2 changer transitions 3/40 dead transitions. [2024-06-14 11:44:39,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 40 transitions, 169 flow [2024-06-14 11:44:40,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:44:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:44:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2024-06-14 11:44:40,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-06-14 11:44:40,011 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 61 flow. Second operand 3 states and 54 transitions. [2024-06-14 11:44:40,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 40 transitions, 169 flow [2024-06-14 11:44:40,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 161 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-14 11:44:40,017 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 67 flow [2024-06-14 11:44:40,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2024-06-14 11:44:40,022 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2024-06-14 11:44:40,022 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 67 flow [2024-06-14 11:44:40,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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) [2024-06-14 11:44:40,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:44:40,023 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:44:40,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:44:40,024 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:44:40,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:44:40,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1606586641, now seen corresponding path program 1 times [2024-06-14 11:44:40,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:44:40,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595102054] [2024-06-14 11:44:40,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:40,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:44:40,070 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-14 11:44:40,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [364588311] [2024-06-14 11:44:40,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:40,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:44:40,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:44:40,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:44:40,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-14 11:44:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:44:40,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2024-06-14 11:44:40,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:44:40,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:44:40,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-14 11:44:40,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:44:40,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595102054] [2024-06-14 11:44:40,302 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-14 11:44:40,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364588311] [2024-06-14 11:44:40,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364588311] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:44:40,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:44:40,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:44:40,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724961743] [2024-06-14 11:44:40,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:44:40,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:44:40,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:44:40,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:44:40,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:44:40,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 11:44:40,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-06-14 11:44:40,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:44:40,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 11:44:40,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:44:40,498 INFO L124 PetriNetUnfolderBase]: 339/609 cut-off events. [2024-06-14 11:44:40,498 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2024-06-14 11:44:40,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 609 events. 339/609 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2424 event pairs, 98 based on Foata normal form. 50/658 useless extension candidates. Maximal degree in co-relation 701. Up to 296 conditions per place. [2024-06-14 11:44:40,503 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 44 selfloop transitions, 4 changer transitions 1/52 dead transitions. [2024-06-14 11:44:40,503 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 52 transitions, 223 flow [2024-06-14 11:44:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:44:40,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:44:40,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 74 transitions. [2024-06-14 11:44:40,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6166666666666667 [2024-06-14 11:44:40,505 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 67 flow. Second operand 4 states and 74 transitions. [2024-06-14 11:44:40,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 52 transitions, 223 flow [2024-06-14 11:44:40,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 52 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:44:40,506 INFO L231 Difference]: Finished difference. Result has 34 places, 28 transitions, 99 flow [2024-06-14 11:44:40,507 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=34, PETRI_TRANSITIONS=28} [2024-06-14 11:44:40,507 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2024-06-14 11:44:40,507 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 28 transitions, 99 flow [2024-06-14 11:44:40,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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) [2024-06-14 11:44:40,508 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:44:40,508 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:44:40,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-14 11:44:40,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:44:40,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:44:40,723 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:44:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash 972635647, now seen corresponding path program 1 times [2024-06-14 11:44:40,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:44:40,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089357266] [2024-06-14 11:44:40,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:40,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:44:40,740 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-14 11:44:40,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [532839331] [2024-06-14 11:44:40,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:44:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:44:40,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:44:40,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-14 11:44:40,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:44:40,855 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-14 11:44:40,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:44:40,970 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-06-14 11:44:41,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:44:41,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:44:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:44:41,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:44:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089357266] [2024-06-14 11:44:41,967 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-14 11:44:41,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532839331] [2024-06-14 11:44:41,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532839331] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:44:41,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-14 11:44:41,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-06-14 11:44:41,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243641892] [2024-06-14 11:44:41,968 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-14 11:44:41,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-06-14 11:44:41,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:44:41,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-06-14 11:44:41,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-06-14 11:44:42,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 11:44:42,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 28 transitions, 99 flow. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:44:42,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:44:42,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 11:44:42,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:44:42,647 INFO L124 PetriNetUnfolderBase]: 945/1730 cut-off events. [2024-06-14 11:44:42,648 INFO L125 PetriNetUnfolderBase]: For 1342/1342 co-relation queries the response was YES. [2024-06-14 11:44:42,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4015 conditions, 1730 events. 945/1730 cut-off events. For 1342/1342 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 8274 event pairs, 60 based on Foata normal form. 199/1929 useless extension candidates. Maximal degree in co-relation 3669. Up to 279 conditions per place. [2024-06-14 11:44:42,655 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 123 selfloop transitions, 26 changer transitions 20/172 dead transitions. [2024-06-14 11:44:42,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 172 transitions, 797 flow [2024-06-14 11:44:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-06-14 11:44:42,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-06-14 11:44:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 259 transitions. [2024-06-14 11:44:42,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5755555555555556 [2024-06-14 11:44:42,658 INFO L175 Difference]: Start difference. First operand has 34 places, 28 transitions, 99 flow. Second operand 15 states and 259 transitions. [2024-06-14 11:44:42,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 172 transitions, 797 flow [2024-06-14 11:44:42,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 172 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:44:42,661 INFO L231 Difference]: Finished difference. Result has 57 places, 55 transitions, 339 flow [2024-06-14 11:44:42,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=339, PETRI_PLACES=57, PETRI_TRANSITIONS=55} [2024-06-14 11:44:42,661 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 26 predicate places. [2024-06-14 11:44:42,662 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 55 transitions, 339 flow [2024-06-14 11:44:42,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 10 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-14 11:44:42,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:44:42,662 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:44:42,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-06-14 11:44:42,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-06-14 11:44:42,874 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:44:42,874 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:44:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 677794535, now seen corresponding path program 1 times [2024-06-14 11:44:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:44:42,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571423452] [2024-06-14 11:44:42,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:42,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:44:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:44:42,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:44:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571423452] [2024-06-14 11:44:42,933 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2024-06-14 11:44:42,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428567901] [2024-06-14 11:44:42,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:42,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:44:42,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:44:42,934 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:44:42,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-14 11:44:43,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:44:43,071 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 3 conjunts are in the unsatisfiable core [2024-06-14 11:44:43,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:44:43,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-14 11:44:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-06-14 11:44:43,088 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-06-14 11:44:43,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428567901] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:44:43,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:44:43,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:44:43,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086622810] [2024-06-14 11:44:43,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:44:43,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:44:43,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:44:43,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:44:43,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:44:43,089 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 30 [2024-06-14 11:44:43,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 55 transitions, 339 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-06-14 11:44:43,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:44:43,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 30 [2024-06-14 11:44:43,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:44:43,375 INFO L124 PetriNetUnfolderBase]: 589/1154 cut-off events. [2024-06-14 11:44:43,388 INFO L125 PetriNetUnfolderBase]: For 2252/2275 co-relation queries the response was YES. [2024-06-14 11:44:43,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1154 events. 589/1154 cut-off events. For 2252/2275 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 5164 event pairs, 195 based on Foata normal form. 73/1217 useless extension candidates. Maximal degree in co-relation 3228. Up to 563 conditions per place. [2024-06-14 11:44:43,395 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 66 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-06-14 11:44:43,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 74 transitions, 594 flow [2024-06-14 11:44:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:44:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:44:43,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-06-14 11:44:43,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5888888888888889 [2024-06-14 11:44:43,400 INFO L175 Difference]: Start difference. First operand has 57 places, 55 transitions, 339 flow. Second operand 3 states and 53 transitions. [2024-06-14 11:44:43,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 74 transitions, 594 flow [2024-06-14 11:44:43,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 74 transitions, 544 flow, removed 22 selfloop flow, removed 2 redundant places. [2024-06-14 11:44:43,419 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 310 flow [2024-06-14 11:44:43,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2024-06-14 11:44:43,420 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 25 predicate places. [2024-06-14 11:44:43,420 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 310 flow [2024-06-14 11:44:43,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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) [2024-06-14 11:44:43,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:44:43,420 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:44:43,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-14 11:44:43,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:44:43,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:44:43,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:44:43,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1566985114, now seen corresponding path program 1 times [2024-06-14 11:44:43,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:44:43,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649369702] [2024-06-14 11:44:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:43,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:44:43,650 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-14 11:44:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309085368] [2024-06-14 11:44:43,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:44:43,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:44:43,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:44:43,651 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:44:43,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-14 11:44:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:44:43,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2024-06-14 11:44:43,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:44:43,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:44:43,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:44:43,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:44:45,266 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:44:45,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:44:47,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 4 [2024-06-14 11:44:47,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:44:49,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 4 [2024-06-14 11:44:49,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-06-14 11:44:51,154 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#ghost~multithreaded| 0) (let ((.cse0 (mod c_~buffer_size~0 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse1 (and (<= 0 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse2 (< .cse0 (+ .cse7 1))) (.cse5 (< c_~buffer_size~0 1)) (.cse4 (= (mod c_~send~0 256) 0)) (.cse3 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (< (mod (mod (+ c_~next~0 1) 4294967296) .cse0) 1) .cse1 .cse2 .cse3 .cse4 (< (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|) 0) .cse5) (or (let ((.cse6 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse0 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse6 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse0 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse6 (+ |~#buffer~0.offset| v_z_9))))))))) .cse1 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) (or .cse2 .cse5)) (not .cse4) (= (* 256 (div c_~receive~0 256)) c_~receive~0) .cse3 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0) (< .cse7 1))))) (< 6 c_~value~0) (< c_~value~0 0)) is different from false [2024-06-14 11:44:51,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-06-14 11:44:51,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-14 11:44:51,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 151 [2024-06-14 11:44:51,975 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-06-14 11:44:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:44:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649369702] [2024-06-14 11:44:51,976 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-14 11:44:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309085368] [2024-06-14 11:44:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309085368] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:44:51,976 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-14 11:44:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 20 [2024-06-14 11:44:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739648867] [2024-06-14 11:44:51,977 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-14 11:44:51,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-06-14 11:44:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:44:51,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-06-14 11:44:51,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=284, Unknown=1, NotChecked=36, Total=420 [2024-06-14 11:44:51,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 30 [2024-06-14 11:44:51,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 310 flow. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 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) [2024-06-14 11:44:51,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:44:51,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 30 [2024-06-14 11:44:51,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:44:52,004 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~buffer_size~0 4294967296)) (.cse36 (mod c_~next~0 4294967296))) (let ((.cse19 (< .cse34 (+ .cse36 1))) (.cse21 (< c_~buffer_size~0 1)) (.cse7 (<= 0 c_~value~0)) (.cse2 (= (mod c_~send~0 256) 0))) (let ((.cse3 (not .cse2)) (.cse6 (and (<= c_~value~0 6) .cse7)) (.cse22 (or .cse19 .cse21)) (.cse33 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse13 (= (mod c_~receive~0 256) 0))) (let ((.cse27 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (not .cse13)) (.cse10 (and .cse22 (not (= .cse33 0)))) (.cse11 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse14 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse16 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (or .cse3 .cse6)) (.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (and (<= 0 .cse30) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse4 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse5 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse9 (and (or .cse10 .cse11 .cse2 .cse14 .cse16) .cse32)) (.cse24 (or .cse8 .cse3 .cse6)) (.cse23 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse18 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse34) 1)) (.cse25 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< (+ c_~value~0 2147483648) 0)) (.cse15 (< 2147483647 c_~value~0)) (.cse26 (and (not (= .cse29 0)) .cse22)) (.cse17 (and (or (let ((.cse35 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse35 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse36 1)) (not (= (+ c_~value~0 1) 0)))) (.cse28 (and (<= 0 .cse33) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse20 (< .cse27 0)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 .cse1 (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (< 6 c_~value~0) (< c_~value~0 0))) .cse4 .cse5) (or .cse0 .cse6) .cse7 (or .cse0 (and (or .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (or .cse0 (and (or .cse18 .cse1 .cse19 .cse4 .cse2 .cse20 .cse21) (or .cse3 (and (or .cse8 .cse6) (or .cse12 .cse1 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) .cse22) .cse23 .cse4 .cse15 .cse5 .cse17))))) (or (and .cse24 (or .cse25 (and (or .cse12 .cse3 .cse23 .cse15 .cse26 .cse17) (or .cse18 (= .cse27 0) .cse19 .cse2 .cse21)) .cse28 .cse20)) .cse0) (or .cse0 .cse9) (or (and .cse24 (let ((.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse29)) (and (or .cse12 .cse3 .cse23 (and .cse22 (not (= .cse30 0))) .cse15 .cse17) (or .cse18 .cse19 .cse2 (= .cse31 0) .cse21)) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (< .cse31 0)))) .cse0) (= c_~send~0 1) (or (and (or .cse8 (and (or .cse25 .cse2 .cse26 .cse28 .cse20) .cse32)) (or .cse25 .cse12 .cse13 .cse15 .cse26 .cse17 .cse28 .cse20)) .cse0))))))) is different from false [2024-06-14 11:44:52,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse34 (mod c_~buffer_size~0 4294967296)) (.cse36 (mod c_~next~0 4294967296))) (let ((.cse19 (< .cse34 (+ .cse36 1))) (.cse21 (< c_~buffer_size~0 1)) (.cse7 (<= 0 c_~value~0)) (.cse2 (= (mod c_~send~0 256) 0))) (let ((.cse3 (not .cse2)) (.cse6 (and (<= c_~value~0 6) .cse7)) (.cse22 (or .cse19 .cse21)) (.cse33 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse13 (= (mod c_~receive~0 256) 0))) (let ((.cse27 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse29 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse8 (not .cse13)) (.cse10 (and .cse22 (not (= .cse33 0)))) (.cse11 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse14 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse16 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (or .cse3 .cse6)) (.cse30 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3))) (let ((.cse1 (and (<= 0 .cse30) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse4 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse5 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse9 (and (or .cse10 .cse11 .cse2 .cse14 .cse16) .cse32)) (.cse24 (or .cse8 .cse3 .cse6)) (.cse23 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse18 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse34) 1)) (.cse25 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse12 (< (+ c_~value~0 2147483648) 0)) (.cse15 (< 2147483647 c_~value~0)) (.cse26 (and (not (= .cse29 0)) .cse22)) (.cse17 (and (or (let ((.cse35 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse35 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse34 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse35 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse36 1)) (not (= (+ c_~value~0 1) 0)))) (.cse28 (and (<= 0 .cse33) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse20 (< .cse27 0)) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 .cse1 (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (< 6 c_~value~0) (< c_~value~0 0))) .cse4 .cse5) (or .cse0 .cse6) .cse7 (or .cse0 (and (or .cse8 .cse9) (or .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17))) (or .cse0 (and (or .cse18 .cse1 .cse19 .cse4 .cse2 .cse20 .cse21) (or .cse3 (and (or .cse8 .cse6) (or .cse12 .cse1 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) .cse22) .cse23 .cse4 .cse15 .cse5 .cse17))))) (or (and .cse24 (or .cse25 (and (or .cse12 .cse3 .cse23 .cse15 .cse26 .cse17) (or .cse18 (= .cse27 0) .cse19 .cse2 .cse21)) .cse28 .cse20)) .cse0) (= |c_#ghost~multithreaded| 1) (or .cse0 .cse9) (or (and .cse24 (let ((.cse31 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse29)) (and (or .cse12 .cse3 .cse23 (and .cse22 (not (= .cse30 0))) .cse15 .cse17) (or .cse18 .cse19 .cse2 (= .cse31 0) .cse21)) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (< .cse31 0)))) .cse0) (= c_~send~0 1) (or (and (or .cse8 (and (or .cse25 .cse2 .cse26 .cse28 .cse20) .cse32)) (or .cse25 .cse12 .cse13 .cse15 .cse26 .cse17 .cse28 .cse20)) .cse0))))))) is different from false [2024-06-14 11:44:52,457 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (mod c_~buffer_size~0 4294967296)) (.cse22 (mod c_~next~0 4294967296))) (let ((.cse2 (= (mod c_~send~0 256) 0)) (.cse14 (< .cse20 (+ .cse22 1))) (.cse15 (< c_~buffer_size~0 1))) (let ((.cse16 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse0 (= |c_#ghost~multithreaded| 0)) (.cse6 (< (+ c_~value~0 2147483648) 0)) (.cse7 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse10 (or .cse14 .cse15)) (.cse1 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse8 (< 2147483647 c_~value~0)) (.cse11 (and (or (let ((.cse21 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse20 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse21 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse20 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse21 (+ |~#buffer~0.offset| v_z_9))))))))) (< .cse22 1)) (not (= (+ c_~value~0 1) 0)))) (.cse4 (not (= (mod c_~receive~0 256) 0))) (.cse5 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse3 (not .cse2)) (.cse12 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse20) 1)) (.cse17 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse9 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or .cse0 (and (<= 0 .cse1) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3)) (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 (< 6 c_~value~0) (< c_~value~0 0))) (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|) (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or (and (or .cse4 .cse3 .cse5) (let ((.cse13 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|) (and (or .cse6 .cse3 .cse7 .cse8 (and (not (= .cse9 0)) .cse10) .cse11) (or .cse12 (= .cse13 0) .cse14 .cse2 .cse15)) (and (<= 0 .cse16) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5)) (< .cse13 0)))) .cse0) (or .cse0 (and (or (and .cse10 (not (= .cse16 0))) (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|)) .cse2 .cse17 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 .cse5))) (or .cse0 (let ((.cse18 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse9))) (.cse19 (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|))) (and (or (and (or .cse18 .cse6 .cse7 (and .cse10 (not (= .cse1 0))) .cse8 .cse19 .cse11 (< (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (or .cse4 .cse5)) .cse3) (or .cse12 .cse18 .cse14 .cse2 .cse17 .cse19 .cse15)))))))) is different from false [2024-06-14 11:44:58,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-14 11:45:25,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod c_~buffer_size~0 4294967296)) (.cse40 (mod c_~next~0 4294967296))) (let ((.cse29 (< .cse39 (+ .cse40 1))) (.cse30 (< c_~buffer_size~0 1)) (.cse2 (= (mod c_~send~0 256) 0))) (let ((.cse28 (+ 2147483649 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse35 (+ |c_t1Thread1of1ForFork0_~i~0#1| 3)) (.cse3 (not .cse2)) (.cse23 (and (<= c_~value~0 6) (<= 0 c_~value~0))) (.cse34 (or .cse29 .cse30)) (.cse38 (+ |c_t1Thread1of1ForFork0_~i~0#1| 1)) (.cse18 (= (mod c_~receive~0 256) 0))) (let ((.cse9 (let ((.cse41 (select |c_#memory_int#2| |c_~#buffer~0.base|))) (and (forall ((v_z_9 Int)) (or (< .cse39 (+ v_z_9 1)) (< v_z_9 2147483648) (forall ((|~#buffer~0.offset| Int)) (not (= (select .cse41 (+ |~#buffer~0.offset| v_z_9 (- 4294967296))) c_~value~0))))) (forall ((v_z_9 Int)) (or (< .cse39 (+ v_z_9 1)) (< v_z_9 0) (< 2147483647 v_z_9) (forall ((|~#buffer~0.offset| Int)) (not (= c_~value~0 (select .cse41 (+ |~#buffer~0.offset| v_z_9)))))))))) (.cse12 (< .cse40 1)) (.cse33 (+ 2 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse13 (not .cse18)) (.cse15 (and .cse34 (not (= .cse38 0)))) (.cse16 (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 6) (<= 0 |c_t1Thread1of1ForFork0_~i~0#1|))) (.cse19 (< (+ |c_t1Thread1of1ForFork0_~i~0#1| 2147483648) 0)) (.cse21 (< 2147483647 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse37 (or .cse3 .cse23)) (.cse27 (< (mod (mod (+ c_~next~0 1) 4294967296) .cse39) 1)) (.cse1 (and (<= 0 .cse35) (<= |c_t1Thread1of1ForFork0_~i~0#1| 3))) (.cse6 (< 2147483644 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse32 (< .cse28 0))) (let ((.cse4 (< 6 c_~value~0)) (.cse5 (< c_~value~0 0)) (.cse8 (or .cse27 .cse1 .cse29 .cse6 .cse2 .cse32 .cse30)) (.cse10 (and (not (= (+ |c_t1Thread1of1ForFork0_~i~0#1| 4) 0)) .cse34)) (.cse7 (< (+ 2147483651 |c_t1Thread1of1ForFork0_~i~0#1|) 0)) (.cse14 (and (or .cse15 .cse16 .cse2 .cse19 .cse21) .cse37)) (.cse24 (or .cse13 .cse3 .cse23)) (.cse11 (= (* 256 (div c_~receive~0 256)) c_~receive~0)) (.cse25 (< 2147483646 |c_t1Thread1of1ForFork0_~i~0#1|)) (.cse17 (< (+ c_~value~0 2147483648) 0)) (.cse20 (< 2147483647 c_~value~0)) (.cse26 (and (not (= .cse33 0)) .cse34)) (.cse22 (and (or .cse9 .cse12) (not (= (+ c_~value~0 1) 0)))) (.cse31 (and (<= 0 .cse38) (<= |c_t1Thread1of1ForFork0_~i~0#1| 5))) (.cse0 (= |c_#ghost~multithreaded| 0))) (and (or .cse0 .cse1 (and (or .cse2 (< |c_t1Thread1of1ForFork0_~i~0#1| 0) (< 6 |c_t1Thread1of1ForFork0_~i~0#1|)) (or .cse3 .cse4 .cse5)) .cse6 .cse7) (or .cse0 (and .cse8 (or .cse9 .cse1 .cse10 .cse3 .cse11 .cse6 .cse7 .cse12)) .cse4 .cse5) (or .cse0 (and (or .cse13 .cse14) (or .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22))) (or .cse0 (and .cse8 (or .cse3 (and (or .cse13 .cse23) (or .cse17 .cse1 .cse10 .cse11 .cse6 .cse20 .cse7 .cse22))))) (or (and .cse24 (or .cse25 (and (or .cse17 .cse3 .cse11 .cse20 .cse26 .cse22) (or .cse27 (= .cse28 0) .cse29 .cse2 .cse30)) .cse31 .cse32)) .cse0) (= |c_#ghost~multithreaded| 1) (or .cse0 .cse14) (or (and .cse24 (let ((.cse36 (+ 2147483650 |c_t1Thread1of1ForFork0_~i~0#1|))) (or (and (<= |c_t1Thread1of1ForFork0_~i~0#1| 4) (<= 0 .cse33)) (and (or .cse17 .cse3 .cse11 (and .cse34 (not (= .cse35 0))) .cse20 .cse22) (or .cse27 .cse29 .cse2 (= .cse36 0) .cse30)) (< 2147483645 |c_t1Thread1of1ForFork0_~i~0#1|) (< .cse36 0)))) .cse0) (= c_~value~0 3) (or (and (or .cse13 (and (or .cse25 .cse2 .cse26 .cse31 .cse32) .cse37)) (or .cse25 .cse17 .cse18 .cse20 .cse26 .cse22 .cse31 .cse32)) .cse0))))))) is different from false [2024-06-14 11:45:34,965 INFO L124 PetriNetUnfolderBase]: 6216/10896 cut-off events. [2024-06-14 11:45:34,965 INFO L125 PetriNetUnfolderBase]: For 35229/35229 co-relation queries the response was YES. [2024-06-14 11:45:35,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33223 conditions, 10896 events. 6216/10896 cut-off events. For 35229/35229 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 71268 event pairs, 597 based on Foata normal form. 150/11045 useless extension candidates. Maximal degree in co-relation 30363. Up to 1434 conditions per place. [2024-06-14 11:45:35,109 INFO L140 encePairwiseOnDemand]: 13/30 looper letters, 423 selfloop transitions, 153 changer transitions 234/811 dead transitions. [2024-06-14 11:45:35,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 811 transitions, 5473 flow [2024-06-14 11:45:35,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2024-06-14 11:45:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2024-06-14 11:45:35,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 801 transitions. [2024-06-14 11:45:35,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4377049180327869 [2024-06-14 11:45:35,118 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 310 flow. Second operand 61 states and 801 transitions. [2024-06-14 11:45:35,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 811 transitions, 5473 flow [2024-06-14 11:45:35,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 811 transitions, 5318 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:45:35,184 INFO L231 Difference]: Finished difference. Result has 147 places, 211 transitions, 1965 flow [2024-06-14 11:45:35,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=1965, PETRI_PLACES=147, PETRI_TRANSITIONS=211} [2024-06-14 11:45:35,185 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 116 predicate places. [2024-06-14 11:45:35,186 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 211 transitions, 1965 flow [2024-06-14 11:45:35,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 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) [2024-06-14 11:45:35,186 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:45:35,186 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:45:35,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-14 11:45:35,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:45:35,398 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:45:35,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:45:35,399 INFO L85 PathProgramCache]: Analyzing trace with hash 415527323, now seen corresponding path program 1 times [2024-06-14 11:45:35,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:45:35,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401258080] [2024-06-14 11:45:35,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:45:35,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:45:35,419 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-14 11:45:35,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622195283] [2024-06-14 11:45:35,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:45:35,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:45:35,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:45:35,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:45:35,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-14 11:45:35,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:45:35,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-14 11:45:35,567 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:45:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:45:35,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:45:35,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-14 11:45:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:45:37,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:45:40,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 4 [2024-06-14 11:45:40,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 4 [2024-06-14 11:45:41,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2024-06-14 11:45:41,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2024-06-14 11:45:41,848 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-06-14 11:45:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:45:42,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:45:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401258080] [2024-06-14 11:45:42,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-14 11:45:42,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622195283] [2024-06-14 11:45:42,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622195283] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:45:42,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-14 11:45:42,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 17 [2024-06-14 11:45:42,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493304707] [2024-06-14 11:45:42,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-14 11:45:42,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-06-14 11:45:42,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:45:42,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-06-14 11:45:42,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2024-06-14 11:45:42,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-06-14 11:45:42,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 211 transitions, 1965 flow. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 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) [2024-06-14 11:45:42,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:45:42,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-06-14 11:45:42,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:45:56,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-14 11:45:57,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2024-06-14 11:46:15,856 INFO L124 PetriNetUnfolderBase]: 6648/12483 cut-off events. [2024-06-14 11:46:15,856 INFO L125 PetriNetUnfolderBase]: For 281696/281710 co-relation queries the response was YES. [2024-06-14 11:46:15,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74373 conditions, 12483 events. 6648/12483 cut-off events. For 281696/281710 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 92074 event pairs, 1328 based on Foata normal form. 328/12687 useless extension candidates. Maximal degree in co-relation 73775. Up to 7382 conditions per place. [2024-06-14 11:46:15,975 INFO L140 encePairwiseOnDemand]: 23/30 looper letters, 341 selfloop transitions, 264 changer transitions 102/710 dead transitions. [2024-06-14 11:46:15,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 710 transitions, 8908 flow [2024-06-14 11:46:15,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-06-14 11:46:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2024-06-14 11:46:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 584 transitions. [2024-06-14 11:46:15,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4634920634920635 [2024-06-14 11:46:15,978 INFO L175 Difference]: Start difference. First operand has 147 places, 211 transitions, 1965 flow. Second operand 42 states and 584 transitions. [2024-06-14 11:46:15,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 710 transitions, 8908 flow [2024-06-14 11:46:16,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 710 transitions, 8330 flow, removed 279 selfloop flow, removed 8 redundant places. [2024-06-14 11:46:16,394 INFO L231 Difference]: Finished difference. Result has 192 places, 383 transitions, 4720 flow [2024-06-14 11:46:16,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1822, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=4720, PETRI_PLACES=192, PETRI_TRANSITIONS=383} [2024-06-14 11:46:16,395 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 161 predicate places. [2024-06-14 11:46:16,395 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 383 transitions, 4720 flow [2024-06-14 11:46:16,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 19 states have internal predecessors, (151), 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) [2024-06-14 11:46:16,396 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:46:16,396 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:46:16,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-06-14 11:46:16,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:46:16,607 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-06-14 11:46:16,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:46:16,608 INFO L85 PathProgramCache]: Analyzing trace with hash 711098554, now seen corresponding path program 2 times [2024-06-14 11:46:16,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:46:16,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102982499] [2024-06-14 11:46:16,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:46:16,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:46:16,629 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2024-06-14 11:46:16,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1707175443] [2024-06-14 11:46:16,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-14 11:46:16,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:46:16,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:46:16,642 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-14 11:46:16,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-06-14 11:46:16,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-14 11:46:16,785 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-14 11:46:16,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 15 conjunts are in the unsatisfiable core [2024-06-14 11:46:16,790 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-14 11:46:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:46:17,015 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-14 11:46:18,844 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-14 11:46:18,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:46:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102982499] [2024-06-14 11:46:18,850 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-06-14 11:46:18,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707175443] [2024-06-14 11:46:18,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707175443] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-14 11:46:18,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-06-14 11:46:18,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2024-06-14 11:46:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737331705] [2024-06-14 11:46:18,851 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-06-14 11:46:18,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-06-14 11:46:18,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:46:18,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-06-14 11:46:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=254, Unknown=0, NotChecked=0, Total=380 [2024-06-14 11:46:18,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 30 [2024-06-14 11:46:18,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 383 transitions, 4720 flow. Second operand has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 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) [2024-06-14 11:46:18,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:46:18,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 30 [2024-06-14 11:46:18,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:46:21,544 INFO L124 PetriNetUnfolderBase]: 6323/11736 cut-off events. [2024-06-14 11:46:21,545 INFO L125 PetriNetUnfolderBase]: For 405953/405971 co-relation queries the response was YES. [2024-06-14 11:46:21,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66609 conditions, 11736 events. 6323/11736 cut-off events. For 405953/405971 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 83924 event pairs, 1194 based on Foata normal form. 481/12214 useless extension candidates. Maximal degree in co-relation 66542. Up to 7195 conditions per place. [2024-06-14 11:46:21,615 INFO L140 encePairwiseOnDemand]: 22/30 looper letters, 0 selfloop transitions, 0 changer transitions 619/619 dead transitions. [2024-06-14 11:46:21,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 619 transitions, 8594 flow [2024-06-14 11:46:21,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-06-14 11:46:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-06-14 11:46:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 235 transitions. [2024-06-14 11:46:21,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4895833333333333 [2024-06-14 11:46:21,620 INFO L175 Difference]: Start difference. First operand has 192 places, 383 transitions, 4720 flow. Second operand 16 states and 235 transitions. [2024-06-14 11:46:21,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 619 transitions, 8594 flow [2024-06-14 11:46:22,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 619 transitions, 7188 flow, removed 478 selfloop flow, removed 26 redundant places. [2024-06-14 11:46:22,347 INFO L231 Difference]: Finished difference. Result has 171 places, 0 transitions, 0 flow [2024-06-14 11:46:22,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3610, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=377, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=377, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=0, PETRI_PLACES=171, PETRI_TRANSITIONS=0} [2024-06-14 11:46:22,348 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 140 predicate places. [2024-06-14 11:46:22,348 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 0 transitions, 0 flow [2024-06-14 11:46:22,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 7.3) internal successors, (146), 20 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) [2024-06-14 11:46:22,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 4 remaining) [2024-06-14 11:46:22,350 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 4 remaining) [2024-06-14 11:46:22,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-06-14 11:46:22,351 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-06-14 11:46:22,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-06-14 11:46:22,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-14 11:46:22,565 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-06-14 11:46:22,567 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 11:46:22,567 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 11:46:22,570 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 11:46:22,570 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 11:46:22,571 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 11:46:22 BasicIcfg [2024-06-14 11:46:22,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 11:46:22,571 INFO L158 Benchmark]: Toolchain (without parser) took 104519.52ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 996.1MB). Free memory was 78.1MB in the beginning and 590.9MB in the end (delta: -512.8MB). Peak memory consumption was 842.5MB. Max. memory is 16.1GB. [2024-06-14 11:46:22,571 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 109.0MB in the beginning and 108.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:46:22,571 INFO L158 Benchmark]: Witness Parser took 0.61ms. Allocated memory is still 153.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:46:22,572 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.16ms. Allocated memory is still 153.1MB. Free memory was 77.8MB in the beginning and 107.0MB in the end (delta: -29.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-06-14 11:46:22,572 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.80ms. Allocated memory is still 153.1MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 11:46:22,572 INFO L158 Benchmark]: Boogie Preprocessor took 61.55ms. Allocated memory is still 153.1MB. Free memory was 104.9MB in the beginning and 101.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-14 11:46:22,572 INFO L158 Benchmark]: RCFGBuilder took 642.46ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 51.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-06-14 11:46:22,573 INFO L158 Benchmark]: TraceAbstraction took 103259.98ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 996.1MB). Free memory was 50.9MB in the beginning and 590.9MB in the end (delta: -539.9MB). Peak memory consumption was 814.7MB. Max. memory is 16.1GB. [2024-06-14 11:46:22,574 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 109.0MB in the beginning and 108.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.61ms. Allocated memory is still 153.1MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 496.16ms. Allocated memory is still 153.1MB. Free memory was 77.8MB in the beginning and 107.0MB in the end (delta: -29.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.80ms. Allocated memory is still 153.1MB. Free memory was 107.0MB in the beginning and 104.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.55ms. Allocated memory is still 153.1MB. Free memory was 104.9MB in the beginning and 101.8MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 642.46ms. Allocated memory is still 153.1MB. Free memory was 101.8MB in the beginning and 51.4MB in the end (delta: 50.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 103259.98ms. Allocated memory was 153.1MB in the beginning and 1.1GB in the end (delta: 996.1MB). Free memory was 50.9MB in the beginning and 590.9MB in the end (delta: -539.9MB). Peak memory consumption was 814.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 764]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 765]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 45 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 103.1s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 82.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 73 mSolverCounterUnknown, 1744 SdHoareTripleChecker+Valid, 24.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1724 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 23.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1044 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 228 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4196 IncrementalHoareTripleChecker+Invalid, 5541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 228 mSolverCounterUnsat, 3 mSDtfsCounter, 4196 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 360 GetRequests, 200 SyntacticMatches, 6 SemanticMatches, 154 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1863 ImplicationChecksByTransitivity, 53.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4720occurred in iteration=6, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.3s InterpolantComputationTime, 195 NumberOfCodeBlocks, 195 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 267 ConstructedInterpolants, 70 QuantifiedInterpolants, 12507 SizeOfPredicates, 121 NumberOfNonLiveVariables, 1296 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 33/162 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 11:46:22,800 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-06-14 11:46:22,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE