./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/triangular-longer-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de 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/triangular-longer-2.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/triangular-longer-2.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 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 21:59:41,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 21:59:41,912 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 21:59:41,916 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 21:59:41,916 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 21:59:41,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 21:59:41,930 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 21:59:41,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 21:59:41,931 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 21:59:41,931 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 21:59:41,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 21:59:41,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 21:59:41,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 21:59:41,933 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 21:59:41,933 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 21:59:41,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 21:59:41,934 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 21:59:41,934 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 21:59:41,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 21:59:41,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 21:59:41,935 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 21:59:41,935 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 21:59:41,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 21:59:41,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 21:59:41,936 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 21:59:41,936 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 21:59:41,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 21:59:41,937 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 21:59:41,937 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 21:59:41,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 21:59:41,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 21:59:41,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 21:59:41,938 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:41,938 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 21:59:41,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 21:59:41,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 21:59:41,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 21:59:41,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 21:59:41,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 21:59:41,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 21:59:41,940 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 21:59:41,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 21:59:41,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 21:59:41,941 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 [2024-06-27 21:59:42,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 21:59:42,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 21:59:42,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 21:59:42,121 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 21:59:42,121 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 21:59:42,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-06-27 21:59:43,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 21:59:43,498 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 21:59:43,499 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-06-27 21:59:43,516 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf7651d4/b523b6169783420dbd25db4f33ac7faf/FLAG85ac6e648 [2024-06-27 21:59:43,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf7651d4/b523b6169783420dbd25db4f33ac7faf [2024-06-27 21:59:43,533 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 21:59:43,534 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 21:59:43,534 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/triangular-longer-2.yml/witness.yml [2024-06-27 21:59:43,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 21:59:43,647 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 21:59:43,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:43,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 21:59:43,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 21:59:43,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:43" (1/2) ... [2024-06-27 21:59:43,653 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a05a408 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:43, skipping insertion in model container [2024-06-27 21:59:43,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:43" (1/2) ... [2024-06-27 21:59:43,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4323a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:43, skipping insertion in model container [2024-06-27 21:59:43,655 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:43" (2/2) ... [2024-06-27 21:59:43,656 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a05a408 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:43, skipping insertion in model container [2024-06-27 21:59:43,657 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:43" (2/2) ... [2024-06-27 21:59:43,657 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 21:59:43,674 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 21:59:43,675 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] ! multithreaded || (1LL - (long long )i) + (long long )j >= 0LL [2024-06-27 21:59:43,675 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] ! multithreaded || (1LL - (long long )i) + (long long )j >= 0LL [2024-06-27 21:59:43,675 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 21:59:43,676 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-06-27 21:59:43,716 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 21:59:43,967 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-06-27 21:59:43,971 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:43,981 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:44,050 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-06-27 21:59:44,050 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:44,076 INFO L206 MainTranslator]: Completed translation [2024-06-27 21:59:44,077 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44 WrapperNode [2024-06-27 21:59:44,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:44,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:44,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 21:59:44,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 21:59:44,084 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 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,093 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 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,106 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-06-27 21:59:44,107 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:44,108 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 21:59:44,108 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 21:59:44,108 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 21:59:44,116 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,128 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-06-27 21:59:44,128 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,131 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,137 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 21:59:44,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 21:59:44,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 21:59:44,138 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 21:59:44,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (1/1) ... [2024-06-27 21:59:44,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:44,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:44,189 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-27 21:59:44,213 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-27 21:59:44,238 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 21:59:44,239 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 21:59:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 21:59:44,239 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 21:59:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 21:59:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 21:59:44,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 21:59:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 21:59:44,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 21:59:44,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 21:59:44,241 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 21:59:44,332 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 21:59:44,334 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 21:59:44,445 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 21:59:44,445 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 21:59:44,554 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 21:59:44,555 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 21:59:44,555 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:44 BoogieIcfgContainer [2024-06-27 21:59:44,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 21:59:44,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 21:59:44,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 21:59:44,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 21:59:44,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 09:59:43" (1/4) ... [2024-06-27 21:59:44,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4018ed08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 09:59:44, skipping insertion in model container [2024-06-27 21:59:44,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 09:59:43" (2/4) ... [2024-06-27 21:59:44,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4018ed08 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:44, skipping insertion in model container [2024-06-27 21:59:44,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44" (3/4) ... [2024-06-27 21:59:44,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4018ed08 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:44, skipping insertion in model container [2024-06-27 21:59:44,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:44" (4/4) ... [2024-06-27 21:59:44,564 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-06-27 21:59:44,578 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 21:59:44,578 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 21:59:44,578 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 21:59:44,616 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 21:59:44,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 21:59:44,674 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-27 21:59:44,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:44,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 3/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-06-27 21:59:44,678 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 21:59:44,680 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 60 flow [2024-06-27 21:59:44,688 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 21:59:44,693 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;@1eb6df56, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 21:59:44,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 21:59:44,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 21:59:44,695 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 21:59:44,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:44,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:44,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 21:59:44,697 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:44,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:44,700 INFO L85 PathProgramCache]: Analyzing trace with hash 176651994, now seen corresponding path program 1 times [2024-06-27 21:59:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:44,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666741951] [2024-06-27 21:59:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:44,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,006 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-27 21:59:45,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666741951] [2024-06-27 21:59:45,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666741951] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 21:59:45,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853451110] [2024-06-27 21:59:45,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:45,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:45,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 21:59:45,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-27 21:59:45,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 21:59:45,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:45,110 INFO L124 PetriNetUnfolderBase]: 172/337 cut-off events. [2024-06-27 21:59:45,111 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 21:59:45,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 636 conditions, 337 events. 172/337 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1436 event pairs, 45 based on Foata normal form. 20/331 useless extension candidates. Maximal degree in co-relation 625. Up to 211 conditions per place. [2024-06-27 21:59:45,113 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2024-06-27 21:59:45,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 139 flow [2024-06-27 21:59:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:45,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:45,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 21:59:45,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-06-27 21:59:45,123 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 60 flow. Second operand 3 states and 65 transitions. [2024-06-27 21:59:45,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 139 flow [2024-06-27 21:59:45,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:45,127 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 75 flow [2024-06-27 21:59:45,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=32, PETRI_TRANSITIONS=27} [2024-06-27 21:59:45,131 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-27 21:59:45,131 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 75 flow [2024-06-27 21:59:45,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-27 21:59:45,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:45,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 21:59:45,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:45,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1314428841, now seen corresponding path program 1 times [2024-06-27 21:59:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019743556] [2024-06-27 21:59:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,168 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-27 21:59:45,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019743556] [2024-06-27 21:59:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019743556] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546764844] [2024-06-27 21:59:45,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:45,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:45,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 21:59:45,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-27 21:59:45,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 21:59:45,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:45,218 INFO L124 PetriNetUnfolderBase]: 91/268 cut-off events. [2024-06-27 21:59:45,218 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-27 21:59:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 494 conditions, 268 events. 91/268 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1333 event pairs, 62 based on Foata normal form. 18/263 useless extension candidates. Maximal degree in co-relation 482. Up to 158 conditions per place. [2024-06-27 21:59:45,220 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 15 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2024-06-27 21:59:45,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 99 flow [2024-06-27 21:59:45,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:45,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-27 21:59:45,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2024-06-27 21:59:45,221 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 75 flow. Second operand 3 states and 49 transitions. [2024-06-27 21:59:45,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 99 flow [2024-06-27 21:59:45,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 96 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 21:59:45,222 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 66 flow [2024-06-27 21:59:45,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-06-27 21:59:45,223 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2024-06-27 21:59:45,223 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 66 flow [2024-06-27 21:59:45,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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-27 21:59:45,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:45,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 21:59:45,224 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:45,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,225 INFO L85 PathProgramCache]: Analyzing trace with hash 344931938, now seen corresponding path program 1 times [2024-06-27 21:59:45,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969671384] [2024-06-27 21:59:45,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,354 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-27 21:59:45,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969671384] [2024-06-27 21:59:45,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969671384] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 21:59:45,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414571879] [2024-06-27 21:59:45,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 21:59:45,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 21:59:45,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 21:59:45,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 21:59:45,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 66 flow. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:45,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 21:59:45,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:45,561 INFO L124 PetriNetUnfolderBase]: 337/579 cut-off events. [2024-06-27 21:59:45,561 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-06-27 21:59:45,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 579 events. 337/579 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2337 event pairs, 74 based on Foata normal form. 0/554 useless extension candidates. Maximal degree in co-relation 1236. Up to 187 conditions per place. [2024-06-27 21:59:45,585 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 28 selfloop transitions, 6 changer transitions 22/61 dead transitions. [2024-06-27 21:59:45,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 61 transitions, 274 flow [2024-06-27 21:59:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 21:59:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 21:59:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-27 21:59:45,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-06-27 21:59:45,589 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 66 flow. Second operand 6 states and 106 transitions. [2024-06-27 21:59:45,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 61 transitions, 274 flow [2024-06-27 21:59:45,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 61 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 21:59:45,590 INFO L231 Difference]: Finished difference. Result has 38 places, 28 transitions, 106 flow [2024-06-27 21:59:45,590 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=38, PETRI_TRANSITIONS=28} [2024-06-27 21:59:45,591 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 7 predicate places. [2024-06-27 21:59:45,591 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 28 transitions, 106 flow [2024-06-27 21:59:45,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 21:59:45,591 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,591 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:45,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 21:59:45,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:45,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1435421146, now seen corresponding path program 1 times [2024-06-27 21:59:45,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978390621] [2024-06-27 21:59:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,675 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-27 21:59:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978390621] [2024-06-27 21:59:45,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978390621] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 21:59:45,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508001009] [2024-06-27 21:59:45,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 21:59:45,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 21:59:45,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 21:59:45,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:45,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 28 transitions, 106 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-27 21:59:45,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:45,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:45,865 INFO L124 PetriNetUnfolderBase]: 415/745 cut-off events. [2024-06-27 21:59:45,865 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2024-06-27 21:59:45,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1858 conditions, 745 events. 415/745 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3282 event pairs, 88 based on Foata normal form. 27/765 useless extension candidates. Maximal degree in co-relation 1845. Up to 247 conditions per place. [2024-06-27 21:59:45,870 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 10 changer transitions 24/88 dead transitions. [2024-06-27 21:59:45,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 460 flow [2024-06-27 21:59:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 21:59:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 21:59:45,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 152 transitions. [2024-06-27 21:59:45,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5241379310344828 [2024-06-27 21:59:45,871 INFO L175 Difference]: Start difference. First operand has 38 places, 28 transitions, 106 flow. Second operand 10 states and 152 transitions. [2024-06-27 21:59:45,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 460 flow [2024-06-27 21:59:45,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 448 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:45,875 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 186 flow [2024-06-27 21:59:45,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=186, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2024-06-27 21:59:45,876 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-27 21:59:45,876 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 186 flow [2024-06-27 21:59:45,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-27 21:59:45,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,877 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 21:59:45,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:45,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1447649696, now seen corresponding path program 2 times [2024-06-27 21:59:45,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482777826] [2024-06-27 21:59:45,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,980 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-27 21:59:45,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482777826] [2024-06-27 21:59:45,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482777826] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 21:59:45,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545364979] [2024-06-27 21:59:45,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 21:59:45,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 21:59:45,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-27 21:59:46,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:46,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-27 21:59:46,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:46,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:46,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:46,143 INFO L124 PetriNetUnfolderBase]: 361/664 cut-off events. [2024-06-27 21:59:46,143 INFO L125 PetriNetUnfolderBase]: For 1690/1690 co-relation queries the response was YES. [2024-06-27 21:59:46,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2093 conditions, 664 events. 361/664 cut-off events. For 1690/1690 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2832 event pairs, 103 based on Foata normal form. 27/684 useless extension candidates. Maximal degree in co-relation 2073. Up to 316 conditions per place. [2024-06-27 21:59:46,147 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 40 selfloop transitions, 13 changer transitions 27/85 dead transitions. [2024-06-27 21:59:46,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 583 flow [2024-06-27 21:59:46,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 21:59:46,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 21:59:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2024-06-27 21:59:46,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5095785440613027 [2024-06-27 21:59:46,148 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 186 flow. Second operand 9 states and 133 transitions. [2024-06-27 21:59:46,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 583 flow [2024-06-27 21:59:46,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 562 flow, removed 8 selfloop flow, removed 2 redundant places. [2024-06-27 21:59:46,153 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 290 flow [2024-06-27 21:59:46,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=290, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2024-06-27 21:59:46,153 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 28 predicate places. [2024-06-27 21:59:46,153 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 290 flow [2024-06-27 21:59:46,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 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-27 21:59:46,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:46,154 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:46,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 21:59:46,154 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:46,154 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:46,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1799527623, now seen corresponding path program 1 times [2024-06-27 21:59:46,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:46,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53999161] [2024-06-27 21:59:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:46,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:46,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:46,235 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-27 21:59:46,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:46,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53999161] [2024-06-27 21:59:46,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53999161] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:46,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:46,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 21:59:46,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106097755] [2024-06-27 21:59:46,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:46,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 21:59:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:46,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 21:59:46,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 21:59:46,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:46,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-27 21:59:46,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:46,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:46,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:46,446 INFO L124 PetriNetUnfolderBase]: 424/785 cut-off events. [2024-06-27 21:59:46,447 INFO L125 PetriNetUnfolderBase]: For 2937/2937 co-relation queries the response was YES. [2024-06-27 21:59:46,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 785 events. 424/785 cut-off events. For 2937/2937 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3447 event pairs, 76 based on Foata normal form. 27/799 useless extension candidates. Maximal degree in co-relation 2683. Up to 223 conditions per place. [2024-06-27 21:59:46,452 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 19 changer transitions 28/95 dead transitions. [2024-06-27 21:59:46,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 95 transitions, 745 flow [2024-06-27 21:59:46,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-27 21:59:46,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-27 21:59:46,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 146 transitions. [2024-06-27 21:59:46,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2024-06-27 21:59:46,454 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 290 flow. Second operand 10 states and 146 transitions. [2024-06-27 21:59:46,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 95 transitions, 745 flow [2024-06-27 21:59:46,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 95 transitions, 724 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 21:59:46,464 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 402 flow [2024-06-27 21:59:46,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=402, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2024-06-27 21:59:46,466 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 36 predicate places. [2024-06-27 21:59:46,467 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 402 flow [2024-06-27 21:59:46,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 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-27 21:59:46,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:46,467 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:46,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 21:59:46,468 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:46,468 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:46,468 INFO L85 PathProgramCache]: Analyzing trace with hash -303138088, now seen corresponding path program 1 times [2024-06-27 21:59:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424023479] [2024-06-27 21:59:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:46,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:46,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424023479] [2024-06-27 21:59:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424023479] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574212721] [2024-06-27 21:59:46,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:46,636 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-27 21:59:46,676 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-27 21:59:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:46,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 21:59:46,738 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:46,816 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:46,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574212721] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:46,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:46,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-06-27 21:59:46,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802026637] [2024-06-27 21:59:46,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:46,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-27 21:59:46,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:46,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-27 21:59:46,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-06-27 21:59:46,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:46,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 402 flow. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 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-27 21:59:46,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:46,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:46,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:47,317 INFO L124 PetriNetUnfolderBase]: 640/1166 cut-off events. [2024-06-27 21:59:47,317 INFO L125 PetriNetUnfolderBase]: For 8503/8503 co-relation queries the response was YES. [2024-06-27 21:59:47,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4730 conditions, 1166 events. 640/1166 cut-off events. For 8503/8503 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5224 event pairs, 64 based on Foata normal form. 45/1198 useless extension candidates. Maximal degree in co-relation 4699. Up to 265 conditions per place. [2024-06-27 21:59:47,324 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 65 selfloop transitions, 34 changer transitions 56/160 dead transitions. [2024-06-27 21:59:47,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 160 transitions, 1470 flow [2024-06-27 21:59:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-27 21:59:47,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-27 21:59:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 275 transitions. [2024-06-27 21:59:47,325 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49909255898366606 [2024-06-27 21:59:47,325 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 402 flow. Second operand 19 states and 275 transitions. [2024-06-27 21:59:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 160 transitions, 1470 flow [2024-06-27 21:59:47,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 160 transitions, 1356 flow, removed 47 selfloop flow, removed 7 redundant places. [2024-06-27 21:59:47,338 INFO L231 Difference]: Finished difference. Result has 85 places, 62 transitions, 709 flow [2024-06-27 21:59:47,339 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=709, PETRI_PLACES=85, PETRI_TRANSITIONS=62} [2024-06-27 21:59:47,340 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 54 predicate places. [2024-06-27 21:59:47,340 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 62 transitions, 709 flow [2024-06-27 21:59:47,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 14 states have internal predecessors, (129), 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-27 21:59:47,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:47,340 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:47,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 21:59:47,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:47,552 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:47,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1915842332, now seen corresponding path program 1 times [2024-06-27 21:59:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088758859] [2024-06-27 21:59:47,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:47,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:47,704 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 21:59:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088758859] [2024-06-27 21:59:47,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088758859] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:47,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668203915] [2024-06-27 21:59:47,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:47,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:47,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:47,721 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-27 21:59:47,772 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-27 21:59:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:47,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-27 21:59:47,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 21:59:47,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 21:59:48,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668203915] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:48,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:48,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-27 21:59:48,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985532641] [2024-06-27 21:59:48,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:48,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 21:59:48,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:48,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 21:59:48,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-06-27 21:59:48,071 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:48,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 62 transitions, 709 flow. Second operand has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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-27 21:59:48,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:48,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:48,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:48,704 INFO L124 PetriNetUnfolderBase]: 1324/2454 cut-off events. [2024-06-27 21:59:48,704 INFO L125 PetriNetUnfolderBase]: For 27891/27891 co-relation queries the response was YES. [2024-06-27 21:59:48,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11382 conditions, 2454 events. 1324/2454 cut-off events. For 27891/27891 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12873 event pairs, 136 based on Foata normal form. 81/2528 useless extension candidates. Maximal degree in co-relation 11345. Up to 589 conditions per place. [2024-06-27 21:59:48,720 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 128 selfloop transitions, 67 changer transitions 91/291 dead transitions. [2024-06-27 21:59:48,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 291 transitions, 3388 flow [2024-06-27 21:59:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-27 21:59:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-27 21:59:48,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 459 transitions. [2024-06-27 21:59:48,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49461206896551724 [2024-06-27 21:59:48,722 INFO L175 Difference]: Start difference. First operand has 85 places, 62 transitions, 709 flow. Second operand 32 states and 459 transitions. [2024-06-27 21:59:48,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 291 transitions, 3388 flow [2024-06-27 21:59:48,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 291 transitions, 2453 flow, removed 453 selfloop flow, removed 10 redundant places. [2024-06-27 21:59:48,747 INFO L231 Difference]: Finished difference. Result has 124 places, 108 transitions, 1264 flow [2024-06-27 21:59:48,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1264, PETRI_PLACES=124, PETRI_TRANSITIONS=108} [2024-06-27 21:59:48,748 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 93 predicate places. [2024-06-27 21:59:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 108 transitions, 1264 flow [2024-06-27 21:59:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.411764705882353) internal successors, (160), 17 states have internal predecessors, (160), 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-27 21:59:48,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:48,749 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:48,770 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-27 21:59:48,960 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,SelfDestructingSolverStorable7 [2024-06-27 21:59:48,960 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:48,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:48,961 INFO L85 PathProgramCache]: Analyzing trace with hash -125286036, now seen corresponding path program 2 times [2024-06-27 21:59:48,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:48,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307849556] [2024-06-27 21:59:48,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:48,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:48,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 21:59:49,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:49,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307849556] [2024-06-27 21:59:49,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307849556] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237068588] [2024-06-27 21:59:49,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 21:59:49,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:49,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:49,077 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-27 21:59:49,109 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-27 21:59:49,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 21:59:49,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:49,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-27 21:59:49,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:49,199 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 21:59:49,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-27 21:59:49,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237068588] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:49,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:49,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-27 21:59:49,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015056142] [2024-06-27 21:59:49,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:49,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-27 21:59:49,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:49,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-27 21:59:49,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-06-27 21:59:49,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:49,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 108 transitions, 1264 flow. Second operand has 17 states, 17 states have (on average 9.470588235294118) internal successors, (161), 17 states have internal predecessors, (161), 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-27 21:59:49,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:49,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:49,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:50,240 INFO L124 PetriNetUnfolderBase]: 1918/3533 cut-off events. [2024-06-27 21:59:50,240 INFO L125 PetriNetUnfolderBase]: For 91123/91123 co-relation queries the response was YES. [2024-06-27 21:59:50,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18677 conditions, 3533 events. 1918/3533 cut-off events. For 91123/91123 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 20228 event pairs, 112 based on Foata normal form. 117/3643 useless extension candidates. Maximal degree in co-relation 18622. Up to 715 conditions per place. [2024-06-27 21:59:50,264 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 132 selfloop transitions, 114 changer transitions 113/364 dead transitions. [2024-06-27 21:59:50,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 364 transitions, 4809 flow [2024-06-27 21:59:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-06-27 21:59:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-06-27 21:59:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 502 transitions. [2024-06-27 21:59:50,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4945812807881773 [2024-06-27 21:59:50,267 INFO L175 Difference]: Start difference. First operand has 124 places, 108 transitions, 1264 flow. Second operand 35 states and 502 transitions. [2024-06-27 21:59:50,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 364 transitions, 4809 flow [2024-06-27 21:59:50,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 364 transitions, 4128 flow, removed 325 selfloop flow, removed 15 redundant places. [2024-06-27 21:59:50,426 INFO L231 Difference]: Finished difference. Result has 156 places, 155 transitions, 2168 flow [2024-06-27 21:59:50,427 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2168, PETRI_PLACES=156, PETRI_TRANSITIONS=155} [2024-06-27 21:59:50,428 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 125 predicate places. [2024-06-27 21:59:50,428 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 155 transitions, 2168 flow [2024-06-27 21:59:50,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 9.470588235294118) internal successors, (161), 17 states have internal predecessors, (161), 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-27 21:59:50,428 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:50,429 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:50,455 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-27 21:59:50,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:50,640 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:50,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:50,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1457754143, now seen corresponding path program 3 times [2024-06-27 21:59:50,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:50,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689479298] [2024-06-27 21:59:50,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:50,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:50,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689479298] [2024-06-27 21:59:50,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689479298] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:50,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056684268] [2024-06-27 21:59:50,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 21:59:50,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:50,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:50,817 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-27 21:59:50,833 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-27 21:59:50,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2024-06-27 21:59:50,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:50,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-27 21:59:50,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:50,927 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:51,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:51,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056684268] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:51,082 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:51,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24 [2024-06-27 21:59:51,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081643283] [2024-06-27 21:59:51,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:51,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-06-27 21:59:51,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:51,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-06-27 21:59:51,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-06-27 21:59:51,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:51,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 155 transitions, 2168 flow. Second operand has 25 states, 25 states have (on average 9.16) internal successors, (229), 25 states have internal predecessors, (229), 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-27 21:59:51,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:51,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:51,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:53,010 INFO L124 PetriNetUnfolderBase]: 3241/5883 cut-off events. [2024-06-27 21:59:53,010 INFO L125 PetriNetUnfolderBase]: For 251400/251400 co-relation queries the response was YES. [2024-06-27 21:59:53,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38333 conditions, 5883 events. 3241/5883 cut-off events. For 251400/251400 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 34030 event pairs, 58 based on Foata normal form. 117/5993 useless extension candidates. Maximal degree in co-relation 38267. Up to 1207 conditions per place. [2024-06-27 21:59:53,131 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 173 selfloop transitions, 207 changer transitions 164/549 dead transitions. [2024-06-27 21:59:53,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 549 transitions, 9783 flow [2024-06-27 21:59:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-06-27 21:59:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-06-27 21:59:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 760 transitions. [2024-06-27 21:59:53,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.494469746258946 [2024-06-27 21:59:53,135 INFO L175 Difference]: Start difference. First operand has 156 places, 155 transitions, 2168 flow. Second operand 53 states and 760 transitions. [2024-06-27 21:59:53,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 549 transitions, 9783 flow [2024-06-27 21:59:53,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 549 transitions, 8104 flow, removed 806 selfloop flow, removed 20 redundant places. [2024-06-27 21:59:53,417 INFO L231 Difference]: Finished difference. Result has 211 places, 261 transitions, 4715 flow [2024-06-27 21:59:53,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1779, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4715, PETRI_PLACES=211, PETRI_TRANSITIONS=261} [2024-06-27 21:59:53,418 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 180 predicate places. [2024-06-27 21:59:53,419 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 261 transitions, 4715 flow [2024-06-27 21:59:53,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 9.16) internal successors, (229), 25 states have internal predecessors, (229), 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-27 21:59:53,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:53,419 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:53,433 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-27 21:59:53,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:53,623 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:53,623 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash -225530276, now seen corresponding path program 4 times [2024-06-27 21:59:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:53,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479050848] [2024-06-27 21:59:53,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:53,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:54,016 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:54,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479050848] [2024-06-27 21:59:54,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479050848] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:54,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542609133] [2024-06-27 21:59:54,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 21:59:54,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:54,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:54,020 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-27 21:59:54,022 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-27 21:59:54,080 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 21:59:54,081 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:54,082 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 21:59:54,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:54,276 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:54,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542609133] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:54,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-27 21:59:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586154501] [2024-06-27 21:59:54,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:54,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 21:59:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:54,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 21:59:54,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 21:59:54,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:54,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 261 transitions, 4715 flow. Second operand has 41 states, 41 states have (on average 9.195121951219512) internal successors, (377), 41 states have internal predecessors, (377), 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-27 21:59:54,833 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:54,833 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:54,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:57,060 INFO L124 PetriNetUnfolderBase]: 3637/6941 cut-off events. [2024-06-27 21:59:57,060 INFO L125 PetriNetUnfolderBase]: For 448166/448166 co-relation queries the response was YES. [2024-06-27 21:59:57,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48636 conditions, 6941 events. 3637/6941 cut-off events. For 448166/448166 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 43348 event pairs, 864 based on Foata normal form. 63/6997 useless extension candidates. Maximal degree in co-relation 48547. Up to 3565 conditions per place. [2024-06-27 21:59:57,123 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 344 selfloop transitions, 132 changer transitions 135/616 dead transitions. [2024-06-27 21:59:57,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 616 transitions, 12687 flow [2024-06-27 21:59:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-06-27 21:59:57,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-06-27 21:59:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 722 transitions. [2024-06-27 21:59:57,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697462589459987 [2024-06-27 21:59:57,125 INFO L175 Difference]: Start difference. First operand has 211 places, 261 transitions, 4715 flow. Second operand 53 states and 722 transitions. [2024-06-27 21:59:57,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 616 transitions, 12687 flow [2024-06-27 21:59:57,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 616 transitions, 8444 flow, removed 2094 selfloop flow, removed 21 redundant places. [2024-06-27 21:59:57,803 INFO L231 Difference]: Finished difference. Result has 248 places, 317 transitions, 4551 flow [2024-06-27 21:59:57,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3210, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4551, PETRI_PLACES=248, PETRI_TRANSITIONS=317} [2024-06-27 21:59:57,804 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 217 predicate places. [2024-06-27 21:59:57,804 INFO L495 AbstractCegarLoop]: Abstraction has has 248 places, 317 transitions, 4551 flow [2024-06-27 21:59:57,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.195121951219512) internal successors, (377), 41 states have internal predecessors, (377), 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-27 21:59:57,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:57,805 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:57,816 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-27 21:59:58,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 21:59:58,016 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 21:59:58,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:58,017 INFO L85 PathProgramCache]: Analyzing trace with hash -649979684, now seen corresponding path program 5 times [2024-06-27 21:59:58,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:58,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753703628] [2024-06-27 21:59:58,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:58,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:58,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753703628] [2024-06-27 21:59:58,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753703628] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143437245] [2024-06-27 21:59:58,343 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 21:59:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:58,356 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-27 21:59:58,358 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-27 21:59:58,410 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-06-27 21:59:58,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:58,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 21:59:58,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:58,541 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:58,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143437245] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:58,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:58,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-27 21:59:58,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597420509] [2024-06-27 21:59:58,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:58,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 21:59:58,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 21:59:58,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 21:59:59,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:59,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 317 transitions, 4551 flow. Second operand has 41 states, 41 states have (on average 9.195121951219512) internal successors, (377), 41 states have internal predecessors, (377), 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-27 21:59:59,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:59,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:59,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:01,988 INFO L124 PetriNetUnfolderBase]: 4933/9726 cut-off events. [2024-06-27 22:00:01,988 INFO L125 PetriNetUnfolderBase]: For 574718/574718 co-relation queries the response was YES. [2024-06-27 22:00:02,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59587 conditions, 9726 events. 4933/9726 cut-off events. For 574718/574718 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 65511 event pairs, 232 based on Foata normal form. 81/9800 useless extension candidates. Maximal degree in co-relation 59492. Up to 1549 conditions per place. [2024-06-27 22:00:02,068 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 268 selfloop transitions, 374 changer transitions 157/804 dead transitions. [2024-06-27 22:00:02,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 804 transitions, 13091 flow [2024-06-27 22:00:02,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 22:00:02,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 22:00:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 816 transitions. [2024-06-27 22:00:02,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47691408533021623 [2024-06-27 22:00:02,070 INFO L175 Difference]: Start difference. First operand has 248 places, 317 transitions, 4551 flow. Second operand 59 states and 816 transitions. [2024-06-27 22:00:02,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 804 transitions, 13091 flow [2024-06-27 22:00:03,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 804 transitions, 12056 flow, removed 438 selfloop flow, removed 29 redundant places. [2024-06-27 22:00:03,078 INFO L231 Difference]: Finished difference. Result has 296 places, 456 transitions, 7466 flow [2024-06-27 22:00:03,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3986, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7466, PETRI_PLACES=296, PETRI_TRANSITIONS=456} [2024-06-27 22:00:03,079 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 265 predicate places. [2024-06-27 22:00:03,079 INFO L495 AbstractCegarLoop]: Abstraction has has 296 places, 456 transitions, 7466 flow [2024-06-27 22:00:03,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.195121951219512) internal successors, (377), 41 states have internal predecessors, (377), 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-27 22:00:03,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:03,079 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:03,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-06-27 22:00:03,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:03,291 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:00:03,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:03,291 INFO L85 PathProgramCache]: Analyzing trace with hash 449762468, now seen corresponding path program 6 times [2024-06-27 22:00:03,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:03,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613480413] [2024-06-27 22:00:03,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:03,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:03,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:03,618 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:03,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613480413] [2024-06-27 22:00:03,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613480413] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:03,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917895234] [2024-06-27 22:00:03,619 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 22:00:03,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:03,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:03,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 22:00:03,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-06-27 22:00:03,676 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2024-06-27 22:00:03,677 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:00:03,678 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 22:00:03,681 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:03,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:04,145 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:04,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917895234] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:04,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:04,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-06-27 22:00:04,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227943333] [2024-06-27 22:00:04,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:04,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-06-27 22:00:04,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:04,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-06-27 22:00:04,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2024-06-27 22:00:04,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:00:04,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 456 transitions, 7466 flow. Second operand has 42 states, 42 states have (on average 9.214285714285714) internal successors, (387), 42 states have internal predecessors, (387), 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-27 22:00:04,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:04,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:00:04,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:07,999 INFO L124 PetriNetUnfolderBase]: 6049/11939 cut-off events. [2024-06-27 22:00:07,999 INFO L125 PetriNetUnfolderBase]: For 978608/978608 co-relation queries the response was YES. [2024-06-27 22:00:08,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81194 conditions, 11939 events. 6049/11939 cut-off events. For 978608/978608 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 84115 event pairs, 118 based on Foata normal form. 81/12013 useless extension candidates. Maximal degree in co-relation 81079. Up to 1903 conditions per place. [2024-06-27 22:00:08,132 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 265 selfloop transitions, 479 changer transitions 155/904 dead transitions. [2024-06-27 22:00:08,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 904 transitions, 16506 flow [2024-06-27 22:00:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 22:00:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 22:00:08,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 826 transitions. [2024-06-27 22:00:08,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-27 22:00:08,134 INFO L175 Difference]: Start difference. First operand has 296 places, 456 transitions, 7466 flow. Second operand 59 states and 826 transitions. [2024-06-27 22:00:08,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 904 transitions, 16506 flow [2024-06-27 22:00:10,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 904 transitions, 14927 flow, removed 743 selfloop flow, removed 22 redundant places. [2024-06-27 22:00:10,638 INFO L231 Difference]: Finished difference. Result has 350 places, 554 transitions, 9783 flow [2024-06-27 22:00:10,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6447, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9783, PETRI_PLACES=350, PETRI_TRANSITIONS=554} [2024-06-27 22:00:10,639 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 319 predicate places. [2024-06-27 22:00:10,639 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 554 transitions, 9783 flow [2024-06-27 22:00:10,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.214285714285714) internal successors, (387), 42 states have internal predecessors, (387), 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-27 22:00:10,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:10,640 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:10,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-06-27 22:00:10,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:10,852 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:00:10,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:10,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1277008734, now seen corresponding path program 7 times [2024-06-27 22:00:10,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:10,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789821272] [2024-06-27 22:00:10,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:10,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:11,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789821272] [2024-06-27 22:00:11,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789821272] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:11,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935699320] [2024-06-27 22:00:11,138 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 22:00:11,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:11,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:11,153 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 22:00:11,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-06-27 22:00:11,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:11,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-27 22:00:11,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:11,278 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:11,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935699320] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:11,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-27 22:00:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766529054] [2024-06-27 22:00:11,579 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:11,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-27 22:00:11,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:11,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-27 22:00:11,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2024-06-27 22:00:11,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:00:11,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 554 transitions, 9783 flow. Second operand has 41 states, 41 states have (on average 9.195121951219512) internal successors, (377), 41 states have internal predecessors, (377), 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-27 22:00:11,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:11,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:00:11,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:16,166 INFO L124 PetriNetUnfolderBase]: 6742/13212 cut-off events. [2024-06-27 22:00:16,167 INFO L125 PetriNetUnfolderBase]: For 1542496/1542496 co-relation queries the response was YES. [2024-06-27 22:00:16,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102159 conditions, 13212 events. 6742/13212 cut-off events. For 1542496/1542496 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 93972 event pairs, 62 based on Foata normal form. 81/13286 useless extension candidates. Maximal degree in co-relation 102026. Up to 2119 conditions per place. [2024-06-27 22:00:16,305 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 258 selfloop transitions, 543 changer transitions 149/955 dead transitions. [2024-06-27 22:00:16,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 955 transitions, 19500 flow [2024-06-27 22:00:16,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-27 22:00:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-27 22:00:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 840 transitions. [2024-06-27 22:00:16,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49094097019286964 [2024-06-27 22:00:16,307 INFO L175 Difference]: Start difference. First operand has 350 places, 554 transitions, 9783 flow. Second operand 59 states and 840 transitions. [2024-06-27 22:00:16,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 955 transitions, 19500 flow [2024-06-27 22:00:20,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 365 places, 955 transitions, 17018 flow, removed 999 selfloop flow, removed 34 redundant places. [2024-06-27 22:00:20,056 INFO L231 Difference]: Finished difference. Result has 386 places, 611 transitions, 11338 flow [2024-06-27 22:00:20,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=8119, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=497, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=11338, PETRI_PLACES=386, PETRI_TRANSITIONS=611} [2024-06-27 22:00:20,057 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 355 predicate places. [2024-06-27 22:00:20,057 INFO L495 AbstractCegarLoop]: Abstraction has has 386 places, 611 transitions, 11338 flow [2024-06-27 22:00:20,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 9.195121951219512) internal successors, (377), 41 states have internal predecessors, (377), 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-27 22:00:20,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:20,058 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:20,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-06-27 22:00:20,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-06-27 22:00:20,269 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:00:20,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:20,269 INFO L85 PathProgramCache]: Analyzing trace with hash 221984087, now seen corresponding path program 8 times [2024-06-27 22:00:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401374462] [2024-06-27 22:00:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:20,547 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:20,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401374462] [2024-06-27 22:00:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401374462] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:20,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161375291] [2024-06-27 22:00:20,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 22:00:20,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:20,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 22:00:20,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-06-27 22:00:20,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 22:00:20,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:00:20,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjunts are in the unsatisfiable core [2024-06-27 22:00:20,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:20,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:21,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161375291] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:21,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:21,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2024-06-27 22:00:21,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55915702] [2024-06-27 22:00:21,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:21,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-06-27 22:00:21,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:21,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-06-27 22:00:21,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2024-06-27 22:00:21,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:00:21,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 611 transitions, 11338 flow. Second operand has 43 states, 43 states have (on average 9.186046511627907) internal successors, (395), 43 states have internal predecessors, (395), 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-27 22:00:21,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:21,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:00:21,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:25,719 INFO L124 PetriNetUnfolderBase]: 7039/13834 cut-off events. [2024-06-27 22:00:25,719 INFO L125 PetriNetUnfolderBase]: For 1888256/1888256 co-relation queries the response was YES. [2024-06-27 22:00:26,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110923 conditions, 13834 events. 7039/13834 cut-off events. For 1888256/1888256 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 98633 event pairs, 282 based on Foata normal form. 63/13884 useless extension candidates. Maximal degree in co-relation 110778. Up to 2239 conditions per place. [2024-06-27 22:00:26,276 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 246 selfloop transitions, 535 changer transitions 111/897 dead transitions. [2024-06-27 22:00:26,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 423 places, 897 transitions, 19022 flow [2024-06-27 22:00:26,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-06-27 22:00:26,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-06-27 22:00:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 665 transitions. [2024-06-27 22:00:26,279 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48789435069699194 [2024-06-27 22:00:26,279 INFO L175 Difference]: Start difference. First operand has 386 places, 611 transitions, 11338 flow. Second operand 47 states and 665 transitions. [2024-06-27 22:00:26,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 423 places, 897 transitions, 19022 flow [2024-06-27 22:00:32,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 897 transitions, 15347 flow, removed 1438 selfloop flow, removed 45 redundant places. [2024-06-27 22:00:32,322 INFO L231 Difference]: Finished difference. Result has 389 places, 642 transitions, 11100 flow [2024-06-27 22:00:32,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9105, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=11100, PETRI_PLACES=389, PETRI_TRANSITIONS=642} [2024-06-27 22:00:32,325 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 358 predicate places. [2024-06-27 22:00:32,325 INFO L495 AbstractCegarLoop]: Abstraction has has 389 places, 642 transitions, 11100 flow [2024-06-27 22:00:32,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.186046511627907) internal successors, (395), 43 states have internal predecessors, (395), 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-27 22:00:32,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:32,326 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:32,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-06-27 22:00:32,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-06-27 22:00:32,529 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:00:32,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:32,530 INFO L85 PathProgramCache]: Analyzing trace with hash -496122342, now seen corresponding path program 9 times [2024-06-27 22:00:32,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:32,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388487123] [2024-06-27 22:00:32,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:32,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:32,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:00:32,540 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:00:32,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:00:32,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:00:32,585 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:00:32,586 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 22:00:32,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 22:00:32,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 22:00:32,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 22:00:32,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 22:00:32,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-06-27 22:00:32,588 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1] [2024-06-27 22:00:32,593 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:00:32,593 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:00:32,669 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:00:32,669 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:00:32,670 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:00:32 BasicIcfg [2024-06-27 22:00:32,670 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:00:32,670 INFO L158 Benchmark]: Toolchain (without parser) took 49022.94ms. Allocated memory was 169.9MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 143.3MB in the beginning and 7.8GB in the end (delta: -7.6GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-06-27 22:00:32,670 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:00:32,670 INFO L158 Benchmark]: Witness Parser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 57.0MB in the beginning and 56.9MB in the end (delta: 118.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:00:32,671 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.25ms. Allocated memory is still 169.9MB. Free memory was 143.3MB in the beginning and 119.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-27 22:00:32,671 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.18ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 117.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:00:32,671 INFO L158 Benchmark]: Boogie Preprocessor took 29.61ms. Allocated memory is still 169.9MB. Free memory was 117.1MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:00:32,671 INFO L158 Benchmark]: RCFGBuilder took 417.65ms. Allocated memory is still 169.9MB. Free memory was 114.9MB in the beginning and 96.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 22:00:32,672 INFO L158 Benchmark]: TraceAbstraction took 48111.53ms. Allocated memory was 169.9MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 96.1MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-06-27 22:00:32,673 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.18ms. Allocated memory is still 127.9MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.12ms. Allocated memory is still 127.9MB. Free memory was 57.0MB in the beginning and 56.9MB in the end (delta: 118.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.25ms. Allocated memory is still 169.9MB. Free memory was 143.3MB in the beginning and 119.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.18ms. Allocated memory is still 169.9MB. Free memory was 119.1MB in the beginning and 117.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.61ms. Allocated memory is still 169.9MB. Free memory was 117.1MB in the beginning and 114.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 417.65ms. Allocated memory is still 169.9MB. Free memory was 114.9MB in the beginning and 96.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 48111.53ms. Allocated memory was 169.9MB in the beginning and 9.1GB in the end (delta: 8.9GB). Free memory was 96.1MB in the beginning and 7.8GB in the end (delta: -7.7GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] 0 //@ assert (!multithreaded || (((1LL - (long long) i) + (long long) j) >= 0LL)); [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=-1, id2=0, j=6, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L715] 0 //@ assert (!multithreaded || (((1LL - (long long) i) + (long long) j) >= 0LL)); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 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: 47.9s, OverallIterations: 16, TraceHistogramMax: 10, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 39.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6395 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6320 mSDsluCounter, 337 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 320 mSDsCounter, 377 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8736 IncrementalHoareTripleChecker+Invalid, 9113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 377 mSolverCounterUnsat, 17 mSDtfsCounter, 8736 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1438 GetRequests, 774 SyntacticMatches, 0 SemanticMatches, 664 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14988 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11338occurred in iteration=14, InterpolantAutomatonStates: 457, 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, 5.6s InterpolantComputationTime, 1051 NumberOfCodeBlocks, 1048 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 1399 ConstructedInterpolants, 0 QuantifiedInterpolants, 5818 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1300 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 33 InterpolantComputations, 6 PerfectInterpolantSequences, 39/3345 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 RESULT: Ultimate proved your program to be incorrect! [2024-06-27 22:00:32,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE