./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-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-longest-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-longest-2.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-rel/triangular-longest-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:42,822 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 21:59:42,883 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:42,888 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 21:59:42,889 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 21:59:42,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 21:59:42,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 21:59:42,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 21:59:42,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 21:59:42,914 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 21:59:42,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 21:59:42,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 21:59:42,915 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 21:59:42,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 21:59:42,916 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 21:59:42,916 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 21:59:42,916 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 21:59:42,916 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 21:59:42,916 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 21:59:42,917 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 21:59:42,917 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 21:59:42,917 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 21:59:42,917 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 21:59:42,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 21:59:42,918 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 21:59:42,918 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 21:59:42,918 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 21:59:42,918 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 21:59:42,919 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 21:59:42,919 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 21:59:42,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 21:59:42,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 21:59:42,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:42,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 21:59:42,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 21:59:42,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 21:59:42,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 21:59:42,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 21:59:42,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 21:59:42,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 21:59:42,921 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 21:59:42,921 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 21:59:42,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 21:59:42,922 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:43,083 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 21:59:43,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 21:59:43,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 21:59:43,107 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 21:59:43,107 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 21:59:43,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-06-27 21:59:44,136 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 21:59:44,375 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 21:59:44,375 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-06-27 21:59:44,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101d77ef0/a677b4c199044817a7f7687a98d72e22/FLAGc8ad2ff09 [2024-06-27 21:59:44,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/101d77ef0/a677b4c199044817a7f7687a98d72e22 [2024-06-27 21:59:44,404 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 21:59:44,405 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 21:59:44,406 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-longest-2.yml/witness.yml [2024-06-27 21:59:44,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 21:59:44,471 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 21:59:44,472 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:44,472 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 21:59:44,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 21:59:44,476 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:44" (1/2) ... [2024-06-27 21:59:44,476 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe17151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:44, skipping insertion in model container [2024-06-27 21:59:44,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 09:59:44" (1/2) ... [2024-06-27 21:59:44,478 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2c0123c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 09:59:44, skipping insertion in model container [2024-06-27 21:59:44,478 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:44" (2/2) ... [2024-06-27 21:59:44,479 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe17151 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 09:59:44, skipping insertion in model container [2024-06-27 21:59:44,479 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:44" (2/2) ... [2024-06-27 21:59:44,479 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 21:59:44,496 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 21:59:44,498 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] ! multithreaded || (1LL - (long long )i) + (long long )j >= 0LL [2024-06-27 21:59:44,498 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] ! multithreaded || (1LL - (long long )i) + (long long )j >= 0LL [2024-06-27 21:59:44,498 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 21:59:44,498 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-06-27 21:59:44,531 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 21:59:44,729 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-longest-2.i[30964,30977] [2024-06-27 21:59:44,732 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:44,738 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 21:59:44,813 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-longest-2.i[30964,30977] [2024-06-27 21:59:44,813 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 21:59:44,835 INFO L206 MainTranslator]: Completed translation [2024-06-27 21:59:44,836 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,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 21:59:44,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:44,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 21:59:44,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 21:59:44,841 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,853 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,865 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-06-27 21:59:44,865 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 21:59:44,866 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 21:59:44,866 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 21:59:44,866 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 21:59:44,872 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,872 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,880 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,892 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,892 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,892 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,896 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,898 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,898 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,899 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,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 21:59:44,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 21:59:44,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 21:59:44,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 21:59:44,902 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,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 21:59:44,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:44,931 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,932 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,959 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 21:59:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 21:59:44,959 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 21:59:44,959 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 21:59:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-27 21:59:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 21:59:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 21:59:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-27 21:59:44,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 21:59:44,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 21:59:44,961 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:45,051 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 21:59:45,053 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 21:59:45,150 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 21:59:45,150 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 21:59:45,223 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 21:59:45,224 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 21:59:45,224 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 09:59:45 BoogieIcfgContainer [2024-06-27 21:59:45,224 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 21:59:45,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 21:59:45,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 21:59:45,228 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 21:59:45,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 09:59:44" (1/4) ... [2024-06-27 21:59:45,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a43511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 09:59:45, skipping insertion in model container [2024-06-27 21:59:45,229 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:44" (2/4) ... [2024-06-27 21:59:45,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a43511 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:45, skipping insertion in model container [2024-06-27 21:59:45,229 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:45,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44a43511 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 09:59:45, skipping insertion in model container [2024-06-27 21:59:45,230 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:45" (4/4) ... [2024-06-27 21:59:45,231 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-06-27 21:59:45,244 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 21:59:45,244 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 21:59:45,244 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 21:59:45,275 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-27 21:59:45,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 21:59:45,338 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-27 21:59:45,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:45,343 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:45,344 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 66 flow [2024-06-27 21:59:45,348 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 60 flow [2024-06-27 21:59:45,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 21:59:45,376 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;@7517148b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 21:59:45,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-27 21:59:45,386 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 21:59:45,387 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-27 21:59:45,387 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 21:59:45,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,388 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-27 21:59:45,388 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:45,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 176651994, now seen corresponding path program 1 times [2024-06-27 21:59:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532569797] [2024-06-27 21:59:45,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,626 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,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532569797] [2024-06-27 21:59:45,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532569797] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 21:59:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418010216] [2024-06-27 21:59:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:45,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:45,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 21:59:45,684 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,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 21:59:45,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:45,786 INFO L124 PetriNetUnfolderBase]: 172/337 cut-off events. [2024-06-27 21:59:45,788 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-27 21:59:45,789 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,793 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2024-06-27 21:59:45,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 139 flow [2024-06-27 21:59:45,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:45,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-27 21:59:45,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-06-27 21:59:45,804 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,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 139 flow [2024-06-27 21:59:45,806 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,808 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 75 flow [2024-06-27 21:59:45,810 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,812 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-27 21:59:45,812 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 75 flow [2024-06-27 21:59:45,812 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,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,813 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:45,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 21:59:45,813 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,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1314428841, now seen corresponding path program 1 times [2024-06-27 21:59:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189022313] [2024-06-27 21:59:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:45,852 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,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189022313] [2024-06-27 21:59:45,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189022313] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:45,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:45,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 21:59:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708946383] [2024-06-27 21:59:45,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:45,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 21:59:45,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:45,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 21:59:45,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 21:59:45,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-27 21:59:45,864 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,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:45,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-27 21:59:45,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:45,908 INFO L124 PetriNetUnfolderBase]: 91/268 cut-off events. [2024-06-27 21:59:45,909 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-06-27 21:59:45,909 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,911 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 15 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2024-06-27 21:59:45,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 99 flow [2024-06-27 21:59:45,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 21:59:45,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 21:59:45,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2024-06-27 21:59:45,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2024-06-27 21:59:45,912 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,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 99 flow [2024-06-27 21:59:45,913 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,913 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 66 flow [2024-06-27 21:59:45,914 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,914 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2024-06-27 21:59:45,914 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 66 flow [2024-06-27 21:59:45,914 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,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:45,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:45,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 21:59:45,915 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,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:45,916 INFO L85 PathProgramCache]: Analyzing trace with hash 344931938, now seen corresponding path program 1 times [2024-06-27 21:59:45,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:45,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490042423] [2024-06-27 21:59:45,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:46,100 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,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:46,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490042423] [2024-06-27 21:59:46,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490042423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:46,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:46,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 21:59:46,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940936382] [2024-06-27 21:59:46,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:46,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 21:59:46,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:46,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 21:59:46,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 21:59:46,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 21:59:46,131 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:46,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:46,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 21:59:46,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:46,302 INFO L124 PetriNetUnfolderBase]: 334/577 cut-off events. [2024-06-27 21:59:46,302 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2024-06-27 21:59:46,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 577 events. 334/577 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2319 event pairs, 49 based on Foata normal form. 0/555 useless extension candidates. Maximal degree in co-relation 1225. Up to 250 conditions per place. [2024-06-27 21:59:46,308 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 31 selfloop transitions, 7 changer transitions 28/71 dead transitions. [2024-06-27 21:59:46,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 71 transitions, 312 flow [2024-06-27 21:59:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 21:59:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 21:59:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-27 21:59:46,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-06-27 21:59:46,312 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 66 flow. Second operand 8 states and 141 transitions. [2024-06-27 21:59:46,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 71 transitions, 312 flow [2024-06-27 21:59:46,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 71 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 21:59:46,317 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 116 flow [2024-06-27 21:59:46,317 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=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2024-06-27 21:59:46,318 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-06-27 21:59:46,318 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 116 flow [2024-06-27 21:59:46,318 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:46,318 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:46,318 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:46,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 21:59:46,319 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:46,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1725427149, now seen corresponding path program 1 times [2024-06-27 21:59:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:46,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669834920] [2024-06-27 21:59:46,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:46,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:46,456 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,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669834920] [2024-06-27 21:59:46,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669834920] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:46,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 21:59:46,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541983552] [2024-06-27 21:59:46,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:46,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 21:59:46,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:46,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 21:59:46,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-27 21:59:46,490 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-27 21:59:46,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 116 flow. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:46,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-27 21:59:46,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:46,586 INFO L124 PetriNetUnfolderBase]: 253/463 cut-off events. [2024-06-27 21:59:46,586 INFO L125 PetriNetUnfolderBase]: For 455/455 co-relation queries the response was YES. [2024-06-27 21:59:46,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1233 conditions, 463 events. 253/463 cut-off events. For 455/455 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1849 event pairs, 76 based on Foata normal form. 18/468 useless extension candidates. Maximal degree in co-relation 1218. Up to 190 conditions per place. [2024-06-27 21:59:46,589 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 28 selfloop transitions, 8 changer transitions 15/56 dead transitions. [2024-06-27 21:59:46,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 312 flow [2024-06-27 21:59:46,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 21:59:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 21:59:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-27 21:59:46,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5804597701149425 [2024-06-27 21:59:46,592 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 116 flow. Second operand 6 states and 101 transitions. [2024-06-27 21:59:46,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 312 flow [2024-06-27 21:59:46,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 56 transitions, 298 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-06-27 21:59:46,597 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 158 flow [2024-06-27 21:59:46,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=158, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2024-06-27 21:59:46,598 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2024-06-27 21:59:46,599 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 158 flow [2024-06-27 21:59:46,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 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,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:46,599 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:46,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 21:59:46,600 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:46,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:46,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2107222436, now seen corresponding path program 1 times [2024-06-27 21:59:46,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:46,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441078677] [2024-06-27 21:59:46,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:46,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:46,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:46,726 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,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:46,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441078677] [2024-06-27 21:59:46,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441078677] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:46,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:46,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-27 21:59:46,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505750027] [2024-06-27 21:59:46,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:46,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-27 21:59:46,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:46,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-27 21:59:46,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-27 21:59:46,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:46,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 158 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,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:46,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:46,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:46,905 INFO L124 PetriNetUnfolderBase]: 298/541 cut-off events. [2024-06-27 21:59:46,905 INFO L125 PetriNetUnfolderBase]: For 894/894 co-relation queries the response was YES. [2024-06-27 21:59:46,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1580 conditions, 541 events. 298/541 cut-off events. For 894/894 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2128 event pairs, 97 based on Foata normal form. 27/561 useless extension candidates. Maximal degree in co-relation 1563. Up to 238 conditions per place. [2024-06-27 21:59:46,908 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 24/76 dead transitions. [2024-06-27 21:59:46,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 76 transitions, 468 flow [2024-06-27 21:59:46,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-27 21:59:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-27 21:59:46,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2024-06-27 21:59:46,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.521551724137931 [2024-06-27 21:59:46,911 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 158 flow. Second operand 8 states and 121 transitions. [2024-06-27 21:59:46,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 76 transitions, 468 flow [2024-06-27 21:59:46,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 445 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:46,916 INFO L231 Difference]: Finished difference. Result has 51 places, 35 transitions, 216 flow [2024-06-27 21:59:46,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=51, PETRI_TRANSITIONS=35} [2024-06-27 21:59:46,920 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2024-06-27 21:59:46,920 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 35 transitions, 216 flow [2024-06-27 21:59:46,921 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,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:46,924 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,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 21:59:46,924 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,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:46,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1033578543, now seen corresponding path program 1 times [2024-06-27 21:59:46,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:46,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378420989] [2024-06-27 21:59:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:47,026 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:47,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:47,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378420989] [2024-06-27 21:59:47,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378420989] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 21:59:47,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 21:59:47,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-27 21:59:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646608673] [2024-06-27 21:59:47,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 21:59:47,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-27 21:59:47,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-27 21:59:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-27 21:59:47,058 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:47,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 35 transitions, 216 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:47,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:47,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:47,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:47,242 INFO L124 PetriNetUnfolderBase]: 388/701 cut-off events. [2024-06-27 21:59:47,242 INFO L125 PetriNetUnfolderBase]: For 2303/2303 co-relation queries the response was YES. [2024-06-27 21:59:47,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 701 events. 388/701 cut-off events. For 2303/2303 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2903 event pairs, 64 based on Foata normal form. 27/715 useless extension candidates. Maximal degree in co-relation 2371. Up to 157 conditions per place. [2024-06-27 21:59:47,247 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 18 changer transitions 30/96 dead transitions. [2024-06-27 21:59:47,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 700 flow [2024-06-27 21:59:47,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-27 21:59:47,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-27 21:59:47,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 161 transitions. [2024-06-27 21:59:47,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047021943573667 [2024-06-27 21:59:47,248 INFO L175 Difference]: Start difference. First operand has 51 places, 35 transitions, 216 flow. Second operand 11 states and 161 transitions. [2024-06-27 21:59:47,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 700 flow [2024-06-27 21:59:47,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 96 transitions, 673 flow, removed 11 selfloop flow, removed 3 redundant places. [2024-06-27 21:59:47,254 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 341 flow [2024-06-27 21:59:47,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=341, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-06-27 21:59:47,257 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-27 21:59:47,257 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 341 flow [2024-06-27 21:59:47,257 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:47,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:47,257 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:47,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 21:59:47,258 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:47,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2103073051, now seen corresponding path program 1 times [2024-06-27 21:59:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:47,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412895004] [2024-06-27 21:59:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:47,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:47,368 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:47,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:47,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412895004] [2024-06-27 21:59:47,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412895004] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:47,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691840004] [2024-06-27 21:59:47,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:47,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:47,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:47,370 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:47,374 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:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:47,451 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-27 21:59:47,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:47,510 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:47,511 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:47,655 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:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [691840004] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:47,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:47,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-06-27 21:59:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994514889] [2024-06-27 21:59:47,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:47,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-27 21:59:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:47,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-27 21:59:47,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-06-27 21:59:47,724 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:47,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 341 flow. Second operand has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:47,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:47,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:48,172 INFO L124 PetriNetUnfolderBase]: 811/1458 cut-off events. [2024-06-27 21:59:48,173 INFO L125 PetriNetUnfolderBase]: For 11121/11121 co-relation queries the response was YES. [2024-06-27 21:59:48,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6189 conditions, 1458 events. 811/1458 cut-off events. For 11121/11121 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6697 event pairs, 74 based on Foata normal form. 72/1523 useless extension candidates. Maximal degree in co-relation 6161. Up to 337 conditions per place. [2024-06-27 21:59:48,180 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 88 selfloop transitions, 38 changer transitions 80/211 dead transitions. [2024-06-27 21:59:48,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 211 transitions, 1928 flow [2024-06-27 21:59:48,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-06-27 21:59:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-06-27 21:59:48,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 390 transitions. [2024-06-27 21:59:48,181 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2024-06-27 21:59:48,182 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 341 flow. Second operand 27 states and 390 transitions. [2024-06-27 21:59:48,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 211 transitions, 1928 flow [2024-06-27 21:59:48,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 211 transitions, 1735 flow, removed 89 selfloop flow, removed 6 redundant places. [2024-06-27 21:59:48,192 INFO L231 Difference]: Finished difference. Result has 99 places, 62 transitions, 745 flow [2024-06-27 21:59:48,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=745, PETRI_PLACES=99, PETRI_TRANSITIONS=62} [2024-06-27 21:59:48,192 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 68 predicate places. [2024-06-27 21:59:48,193 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 62 transitions, 745 flow [2024-06-27 21:59:48,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.23076923076923) internal successors, (120), 13 states have internal predecessors, (120), 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,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:48,193 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:48,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-06-27 21:59:48,407 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:48,407 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:48,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:48,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1950091076, now seen corresponding path program 1 times [2024-06-27 21:59:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504711342] [2024-06-27 21:59:48,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:48,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504711342] [2024-06-27 21:59:48,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504711342] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:48,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056854231] [2024-06-27 21:59:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:48,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:48,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:48,500 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:48,504 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:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:48,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2024-06-27 21:59:48,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:48,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056854231] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:48,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-06-27 21:59:48,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227114749] [2024-06-27 21:59:48,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:48,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-06-27 21:59:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:48,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-06-27 21:59:48,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-06-27 21:59:48,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:48,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 62 transitions, 745 flow. Second operand has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:48,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:49,260 INFO L124 PetriNetUnfolderBase]: 1153/2107 cut-off events. [2024-06-27 21:59:49,260 INFO L125 PetriNetUnfolderBase]: For 64587/64587 co-relation queries the response was YES. [2024-06-27 21:59:49,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13077 conditions, 2107 events. 1153/2107 cut-off events. For 64587/64587 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 10395 event pairs, 52 based on Foata normal form. 108/2202 useless extension candidates. Maximal degree in co-relation 13032. Up to 493 conditions per place. [2024-06-27 21:59:49,274 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 101 selfloop transitions, 62 changer transitions 97/265 dead transitions. [2024-06-27 21:59:49,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 265 transitions, 3898 flow [2024-06-27 21:59:49,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-06-27 21:59:49,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2024-06-27 21:59:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 447 transitions. [2024-06-27 21:59:49,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4972191323692992 [2024-06-27 21:59:49,277 INFO L175 Difference]: Start difference. First operand has 99 places, 62 transitions, 745 flow. Second operand 31 states and 447 transitions. [2024-06-27 21:59:49,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 265 transitions, 3898 flow [2024-06-27 21:59:49,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 265 transitions, 3288 flow, removed 295 selfloop flow, removed 12 redundant places. [2024-06-27 21:59:49,318 INFO L231 Difference]: Finished difference. Result has 132 places, 86 transitions, 1398 flow [2024-06-27 21:59:49,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=1398, PETRI_PLACES=132, PETRI_TRANSITIONS=86} [2024-06-27 21:59:49,319 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 101 predicate places. [2024-06-27 21:59:49,319 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 86 transitions, 1398 flow [2024-06-27 21:59:49,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.266666666666667) internal successors, (139), 15 states have internal predecessors, (139), 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,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:49,319 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:49,333 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:49,534 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:49,535 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:49,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1772895453, now seen corresponding path program 2 times [2024-06-27 21:59:49,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:49,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890117881] [2024-06-27 21:59:49,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:49,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890117881] [2024-06-27 21:59:49,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890117881] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:49,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802000611] [2024-06-27 21:59:49,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 21:59:49,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:49,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:49,673 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,700 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,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 21:59:49,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:49,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2024-06-27 21:59:49,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:49,774 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:49,774 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:49,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802000611] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:49,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:49,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2024-06-27 21:59:49,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213229365] [2024-06-27 21:59:49,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:49,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-06-27 21:59:49,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:49,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-06-27 21:59:49,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2024-06-27 21:59:49,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:49,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 86 transitions, 1398 flow. Second operand has 22 states, 22 states have (on average 9.136363636363637) internal successors, (201), 22 states have internal predecessors, (201), 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,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:49,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:49,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:51,046 INFO L124 PetriNetUnfolderBase]: 1594/2890 cut-off events. [2024-06-27 21:59:51,047 INFO L125 PetriNetUnfolderBase]: For 185640/185640 co-relation queries the response was YES. [2024-06-27 21:59:51,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22881 conditions, 2890 events. 1594/2890 cut-off events. For 185640/185640 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 14362 event pairs, 46 based on Foata normal form. 144/3027 useless extension candidates. Maximal degree in co-relation 22821. Up to 661 conditions per place. [2024-06-27 21:59:51,124 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 139 selfloop transitions, 94 changer transitions 147/385 dead transitions. [2024-06-27 21:59:51,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 385 transitions, 7395 flow [2024-06-27 21:59:51,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-06-27 21:59:51,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-06-27 21:59:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 659 transitions. [2024-06-27 21:59:51,128 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49400299850074963 [2024-06-27 21:59:51,128 INFO L175 Difference]: Start difference. First operand has 132 places, 86 transitions, 1398 flow. Second operand 46 states and 659 transitions. [2024-06-27 21:59:51,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 385 transitions, 7395 flow [2024-06-27 21:59:51,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 385 transitions, 5885 flow, removed 732 selfloop flow, removed 18 redundant places. [2024-06-27 21:59:51,315 INFO L231 Difference]: Finished difference. Result has 179 places, 119 transitions, 2234 flow [2024-06-27 21:59:51,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=946, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2234, PETRI_PLACES=179, PETRI_TRANSITIONS=119} [2024-06-27 21:59:51,315 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 148 predicate places. [2024-06-27 21:59:51,316 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 119 transitions, 2234 flow [2024-06-27 21:59:51,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 9.136363636363637) internal successors, (201), 22 states have internal predecessors, (201), 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,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:51,316 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:51,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 21:59:51,528 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:51,530 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:51,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:51,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1052750701, now seen corresponding path program 3 times [2024-06-27 21:59:51,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:51,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433523894] [2024-06-27 21:59:51,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:51,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:51,765 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:51,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433523894] [2024-06-27 21:59:51,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433523894] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:51,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773043368] [2024-06-27 21:59:51,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 21:59:51,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:51,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:51,767 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:51,789 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:51,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-06-27 21:59:51,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:51,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjunts are in the unsatisfiable core [2024-06-27 21:59:51,820 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:51,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:52,168 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 21:59:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773043368] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:52,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:52,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2024-06-27 21:59:52,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637289736] [2024-06-27 21:59:52,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:52,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-06-27 21:59:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:52,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-06-27 21:59:52,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=866, Unknown=0, NotChecked=0, Total=1122 [2024-06-27 21:59:52,268 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:52,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 119 transitions, 2234 flow. Second operand has 34 states, 34 states have (on average 9.088235294117647) internal successors, (309), 34 states have internal predecessors, (309), 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:52,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:52,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:52,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 21:59:54,391 INFO L124 PetriNetUnfolderBase]: 2575/4630 cut-off events. [2024-06-27 21:59:54,391 INFO L125 PetriNetUnfolderBase]: For 481157/481157 co-relation queries the response was YES. [2024-06-27 21:59:54,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43107 conditions, 4630 events. 2575/4630 cut-off events. For 481157/481157 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 22514 event pairs, 52 based on Foata normal form. 135/4758 useless extension candidates. Maximal degree in co-relation 43029. Up to 1066 conditions per place. [2024-06-27 21:59:54,430 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 215 selfloop transitions, 157 changer transitions 210/587 dead transitions. [2024-06-27 21:59:54,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 587 transitions, 13560 flow [2024-06-27 21:59:54,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-06-27 21:59:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2024-06-27 21:59:54,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 1014 transitions. [2024-06-27 21:59:54,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4924720738222438 [2024-06-27 21:59:54,432 INFO L175 Difference]: Start difference. First operand has 179 places, 119 transitions, 2234 flow. Second operand 71 states and 1014 transitions. [2024-06-27 21:59:54,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 587 transitions, 13560 flow [2024-06-27 21:59:54,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 587 transitions, 11124 flow, removed 1195 selfloop flow, removed 23 redundant places. [2024-06-27 21:59:54,761 INFO L231 Difference]: Finished difference. Result has 258 places, 184 transitions, 4230 flow [2024-06-27 21:59:54,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=4230, PETRI_PLACES=258, PETRI_TRANSITIONS=184} [2024-06-27 21:59:54,762 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 227 predicate places. [2024-06-27 21:59:54,762 INFO L495 AbstractCegarLoop]: Abstraction has has 258 places, 184 transitions, 4230 flow [2024-06-27 21:59:54,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 9.088235294117647) internal successors, (309), 34 states have internal predecessors, (309), 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,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 21:59:54,763 INFO L208 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 21:59:54,774 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:54,963 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:54,964 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:54,964 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 21:59:54,964 INFO L85 PathProgramCache]: Analyzing trace with hash 2044013326, now seen corresponding path program 4 times [2024-06-27 21:59:54,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 21:59:54,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459054726] [2024-06-27 21:59:54,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 21:59:54,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 21:59:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 21:59:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 21:59:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459054726] [2024-06-27 21:59:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459054726] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 21:59:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728401992] [2024-06-27 21:59:55,484 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 21:59:55,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 21:59:55,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 21:59:55,485 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:55,487 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:55,545 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 21:59:55,545 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 21:59:55,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjunts are in the unsatisfiable core [2024-06-27 21:59:55,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 21:59:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:55,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 21:59:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 21:59:56,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728401992] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 21:59:56,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 21:59:56,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2024-06-27 21:59:56,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732596515] [2024-06-27 21:59:56,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 21:59:56,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-06-27 21:59:56,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 21:59:56,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-06-27 21:59:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=697, Invalid=2495, Unknown=0, NotChecked=0, Total=3192 [2024-06-27 21:59:56,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 21:59:56,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 184 transitions, 4230 flow. Second operand has 57 states, 57 states have (on average 9.12280701754386) internal successors, (520), 57 states have internal predecessors, (520), 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:56,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 21:59:56,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 21:59:56,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:00,201 INFO L124 PetriNetUnfolderBase]: 3673/7128 cut-off events. [2024-06-27 22:00:00,201 INFO L125 PetriNetUnfolderBase]: For 1408425/1408425 co-relation queries the response was YES. [2024-06-27 22:00:00,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84672 conditions, 7128 events. 3673/7128 cut-off events. For 1408425/1408425 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 39568 event pairs, 798 based on Foata normal form. 171/7292 useless extension candidates. Maximal degree in co-relation 84563. Up to 2980 conditions per place. [2024-06-27 22:00:00,279 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 327 selfloop transitions, 154 changer transitions 251/737 dead transitions. [2024-06-27 22:00:00,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 737 transitions, 23953 flow [2024-06-27 22:00:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2024-06-27 22:00:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2024-06-27 22:00:00,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 1110 transitions. [2024-06-27 22:00:00,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725415070242657 [2024-06-27 22:00:00,282 INFO L175 Difference]: Start difference. First operand has 258 places, 184 transitions, 4230 flow. Second operand 81 states and 1110 transitions. [2024-06-27 22:00:00,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 737 transitions, 23953 flow [2024-06-27 22:00:03,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 737 transitions, 17652 flow, removed 3073 selfloop flow, removed 37 redundant places. [2024-06-27 22:00:03,573 INFO L231 Difference]: Finished difference. Result has 329 places, 297 transitions, 6767 flow [2024-06-27 22:00:03,573 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2723, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=6767, PETRI_PLACES=329, PETRI_TRANSITIONS=297} [2024-06-27 22:00:03,574 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 298 predicate places. [2024-06-27 22:00:03,574 INFO L495 AbstractCegarLoop]: Abstraction has has 329 places, 297 transitions, 6767 flow [2024-06-27 22:00:03,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 9.12280701754386) internal successors, (520), 57 states have internal predecessors, (520), 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,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:03,575 INFO L208 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:03,589 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 22:00:03,777 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 22:00:03,778 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 22:00:03,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:03,778 INFO L85 PathProgramCache]: Analyzing trace with hash -563467152, now seen corresponding path program 5 times [2024-06-27 22:00:03,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:03,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133822212] [2024-06-27 22:00:03,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:03,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:03,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133822212] [2024-06-27 22:00:04,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133822212] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:04,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445113070] [2024-06-27 22:00:04,299 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 22:00:04,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:04,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:04,300 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 22:00:04,339 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 22:00:04,375 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2024-06-27 22:00:04,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:00:04,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjunts are in the unsatisfiable core [2024-06-27 22:00:04,378 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:04,542 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:04,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:05,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445113070] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:05,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:05,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 56 [2024-06-27 22:00:05,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13744665] [2024-06-27 22:00:05,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:05,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-06-27 22:00:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:05,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-06-27 22:00:05,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=2605, Unknown=0, NotChecked=0, Total=3192 [2024-06-27 22:00:05,458 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:00:05,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 297 transitions, 6767 flow. Second operand has 57 states, 57 states have (on average 9.12280701754386) internal successors, (520), 57 states have internal predecessors, (520), 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:05,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:05,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:00:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:10,454 INFO L124 PetriNetUnfolderBase]: 4951/10088 cut-off events. [2024-06-27 22:00:10,454 INFO L125 PetriNetUnfolderBase]: For 2689790/2689790 co-relation queries the response was YES. [2024-06-27 22:00:10,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126182 conditions, 10088 events. 4951/10088 cut-off events. For 2689790/2689790 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 63671 event pairs, 434 based on Foata normal form. 171/10252 useless extension candidates. Maximal degree in co-relation 126049. Up to 2650 conditions per place. [2024-06-27 22:00:10,564 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 305 selfloop transitions, 355 changer transitions 267/932 dead transitions. [2024-06-27 22:00:10,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 932 transitions, 29222 flow [2024-06-27 22:00:10,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-06-27 22:00:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2024-06-27 22:00:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 1230 transitions. [2024-06-27 22:00:10,572 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47655947307245256 [2024-06-27 22:00:10,572 INFO L175 Difference]: Start difference. First operand has 329 places, 297 transitions, 6767 flow. Second operand 89 states and 1230 transitions. [2024-06-27 22:00:10,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 932 transitions, 29222 flow [2024-06-27 22:00:18,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 932 transitions, 25352 flow, removed 1888 selfloop flow, removed 38 redundant places. [2024-06-27 22:00:18,810 INFO L231 Difference]: Finished difference. Result has 401 places, 442 transitions, 11281 flow [2024-06-27 22:00:18,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=5411, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=231, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=89, PETRI_FLOW=11281, PETRI_PLACES=401, PETRI_TRANSITIONS=442} [2024-06-27 22:00:18,811 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 370 predicate places. [2024-06-27 22:00:18,811 INFO L495 AbstractCegarLoop]: Abstraction has has 401 places, 442 transitions, 11281 flow [2024-06-27 22:00:18,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 9.12280701754386) internal successors, (520), 57 states have internal predecessors, (520), 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:18,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:18,811 INFO L208 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 12, 12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:18,825 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:19,012 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:19,012 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:19,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:19,013 INFO L85 PathProgramCache]: Analyzing trace with hash -993799944, now seen corresponding path program 6 times [2024-06-27 22:00:19,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:19,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768906479] [2024-06-27 22:00:19,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:19,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:19,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768906479] [2024-06-27 22:00:19,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768906479] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:19,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053914977] [2024-06-27 22:00:19,453 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-27 22:00:19,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:19,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:19,454 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:19,455 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:19,511 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2024-06-27 22:00:19,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:00:19,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 31 conjunts are in the unsatisfiable core [2024-06-27 22:00:19,514 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 1 proven. 444 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:19,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 445 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053914977] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:20,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2024-06-27 22:00:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959248687] [2024-06-27 22:00:20,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:20,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-06-27 22:00:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-06-27 22:00:20,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=514, Invalid=2792, Unknown=0, NotChecked=0, Total=3306 [2024-06-27 22:00:20,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:00:20,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 401 places, 442 transitions, 11281 flow. Second operand has 58 states, 58 states have (on average 9.137931034482758) internal successors, (530), 58 states have internal predecessors, (530), 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,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:20,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:00:20,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:28,671 INFO L124 PetriNetUnfolderBase]: 7300/14609 cut-off events. [2024-06-27 22:00:28,671 INFO L125 PetriNetUnfolderBase]: For 5241903/5241903 co-relation queries the response was YES. [2024-06-27 22:00:28,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201067 conditions, 14609 events. 7300/14609 cut-off events. For 5241903/5241903 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 98870 event pairs, 102 based on Foata normal form. 180/14782 useless extension candidates. Maximal degree in co-relation 200911. Up to 3775 conditions per place. [2024-06-27 22:00:28,842 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 317 selfloop transitions, 596 changer transitions 304/1222 dead transitions. [2024-06-27 22:00:28,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 487 places, 1222 transitions, 42082 flow [2024-06-27 22:00:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2024-06-27 22:00:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2024-06-27 22:00:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 1483 transitions. [2024-06-27 22:00:28,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48243331164606373 [2024-06-27 22:00:28,845 INFO L175 Difference]: Start difference. First operand has 401 places, 442 transitions, 11281 flow. Second operand 106 states and 1483 transitions. [2024-06-27 22:00:28,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 487 places, 1222 transitions, 42082 flow [2024-06-27 22:00:46,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 1222 transitions, 36344 flow, removed 2747 selfloop flow, removed 47 redundant places. [2024-06-27 22:00:46,419 INFO L231 Difference]: Finished difference. Result has 490 places, 632 transitions, 17163 flow [2024-06-27 22:00:46,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9095, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=413, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=106, PETRI_FLOW=17163, PETRI_PLACES=490, PETRI_TRANSITIONS=632} [2024-06-27 22:00:46,420 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 459 predicate places. [2024-06-27 22:00:46,420 INFO L495 AbstractCegarLoop]: Abstraction has has 490 places, 632 transitions, 17163 flow [2024-06-27 22:00:46,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 9.137931034482758) internal successors, (530), 58 states have internal predecessors, (530), 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:46,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:00:46,421 INFO L208 CegarLoopForPetriNet]: trace histogram [14, 14, 13, 13, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:00:46,434 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:46,624 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:46,624 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:46,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:00:46,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2122050713, now seen corresponding path program 7 times [2024-06-27 22:00:46,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:00:46,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246414489] [2024-06-27 22:00:46,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:00:46,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:00:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:47,040 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:47,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:00:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246414489] [2024-06-27 22:00:47,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246414489] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:00:47,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210955061] [2024-06-27 22:00:47,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-27 22:00:47,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:00:47,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:00:47,042 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:47,043 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:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:00:47,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-27 22:00:47,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:00:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:47,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:00:47,757 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 22:00:47,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210955061] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:00:47,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:00:47,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2024-06-27 22:00:47,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865476355] [2024-06-27 22:00:47,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:00:47,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-06-27 22:00:47,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:00:47,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-06-27 22:00:47,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=2640, Unknown=0, NotChecked=0, Total=3422 [2024-06-27 22:00:47,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:00:47,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 632 transitions, 17163 flow. Second operand has 59 states, 59 states have (on average 9.11864406779661) internal successors, (538), 59 states have internal predecessors, (538), 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:47,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:00:47,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:00:47,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:00:57,653 INFO L124 PetriNetUnfolderBase]: 8587/17270 cut-off events. [2024-06-27 22:00:57,653 INFO L125 PetriNetUnfolderBase]: For 9316800/9316800 co-relation queries the response was YES. [2024-06-27 22:00:57,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 283977 conditions, 17270 events. 8587/17270 cut-off events. For 9316800/9316800 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 118273 event pairs, 116 based on Foata normal form. 153/17410 useless extension candidates. Maximal degree in co-relation 283789. Up to 4429 conditions per place. [2024-06-27 22:00:57,975 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 336 selfloop transitions, 701 changer transitions 269/1311 dead transitions. [2024-06-27 22:00:57,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 1311 transitions, 54924 flow [2024-06-27 22:00:57,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-06-27 22:00:57,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2024-06-27 22:00:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1407 transitions. [2024-06-27 22:00:57,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49007314524555906 [2024-06-27 22:00:57,990 INFO L175 Difference]: Start difference. First operand has 490 places, 632 transitions, 17163 flow. Second operand 99 states and 1407 transitions. [2024-06-27 22:00:57,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 1311 transitions, 54924 flow [2024-06-27 22:01:32,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 1311 transitions, 43232 flow, removed 5669 selfloop flow, removed 53 redundant places. [2024-06-27 22:01:32,650 INFO L231 Difference]: Finished difference. Result has 562 places, 747 transitions, 21933 flow [2024-06-27 22:01:32,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=13419, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=632, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=591, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=21933, PETRI_PLACES=562, PETRI_TRANSITIONS=747} [2024-06-27 22:01:32,651 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 531 predicate places. [2024-06-27 22:01:32,651 INFO L495 AbstractCegarLoop]: Abstraction has has 562 places, 747 transitions, 21933 flow [2024-06-27 22:01:32,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 9.11864406779661) internal successors, (538), 59 states have internal predecessors, (538), 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:01:32,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:01:32,652 INFO L208 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:01:32,662 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:01:32,852 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:01:32,853 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:01:32,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:01:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1721659358, now seen corresponding path program 8 times [2024-06-27 22:01:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:01:32,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544104410] [2024-06-27 22:01:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:01:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:01:32,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:01:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:01:33,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:01:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544104410] [2024-06-27 22:01:33,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544104410] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:01:33,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107063170] [2024-06-27 22:01:33,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 22:01:33,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:01:33,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:01:33,515 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:01:33,515 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:01:33,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 22:01:33,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:01:33,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 44 conjunts are in the unsatisfiable core [2024-06-27 22:01:33,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:01:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:01:33,733 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:01:34,514 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:01:34,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107063170] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:01:34,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:01:34,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2024-06-27 22:01:34,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641782894] [2024-06-27 22:01:34,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:01:34,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-06-27 22:01:34,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:01:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-06-27 22:01:34,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1508, Invalid=5134, Unknown=0, NotChecked=0, Total=6642 [2024-06-27 22:01:34,637 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:01:34,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 747 transitions, 21933 flow. Second operand has 82 states, 82 states have (on average 9.036585365853659) internal successors, (741), 82 states have internal predecessors, (741), 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:01:34,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:01:34,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:01:34,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:01:46,494 INFO L124 PetriNetUnfolderBase]: 9001/18049 cut-off events. [2024-06-27 22:01:46,494 INFO L125 PetriNetUnfolderBase]: For 11921788/11921788 co-relation queries the response was YES. [2024-06-27 22:01:46,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311936 conditions, 18049 events. 9001/18049 cut-off events. For 11921788/11921788 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 123885 event pairs, 46 based on Foata normal form. 108/18150 useless extension candidates. Maximal degree in co-relation 311721. Up to 4543 conditions per place. [2024-06-27 22:01:46,827 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 333 selfloop transitions, 757 changer transitions 223/1318 dead transitions. [2024-06-27 22:01:46,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 1318 transitions, 52215 flow [2024-06-27 22:01:46,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-06-27 22:01:46,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2024-06-27 22:01:46,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 1327 transitions. [2024-06-27 22:01:46,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867938371239912 [2024-06-27 22:01:46,829 INFO L175 Difference]: Start difference. First operand has 562 places, 747 transitions, 21933 flow. Second operand 94 states and 1327 transitions. [2024-06-27 22:01:46,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 1318 transitions, 52215 flow [2024-06-27 22:02:51,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 596 places, 1318 transitions, 42088 flow, removed 4943 selfloop flow, removed 42 redundant places. [2024-06-27 22:02:51,100 INFO L231 Difference]: Finished difference. Result has 613 places, 791 transitions, 21358 flow [2024-06-27 22:02:51,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=17294, PETRI_DIFFERENCE_MINUEND_PLACES=503, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=747, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=714, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=21358, PETRI_PLACES=613, PETRI_TRANSITIONS=791} [2024-06-27 22:02:51,101 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 582 predicate places. [2024-06-27 22:02:51,101 INFO L495 AbstractCegarLoop]: Abstraction has has 613 places, 791 transitions, 21358 flow [2024-06-27 22:02:51,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 9.036585365853659) internal successors, (741), 82 states have internal predecessors, (741), 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:02:51,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:02:51,101 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:02:51,116 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:02:51,302 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:02:51,302 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:02:51,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:02:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1241412648, now seen corresponding path program 9 times [2024-06-27 22:02:51,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:02:51,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601081515] [2024-06-27 22:02:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:02:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:02:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 22:02:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 1046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:02:52,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 22:02:52,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601081515] [2024-06-27 22:02:52,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601081515] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 22:02:52,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482447493] [2024-06-27 22:02:52,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 22:02:52,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 22:02:52,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 22:02:52,023 INFO L229 MonitoredProcess]: Starting monitored process 11 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:02:52,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-06-27 22:02:52,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2024-06-27 22:02:52,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 22:02:52,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 46 conjunts are in the unsatisfiable core [2024-06-27 22:02:52,132 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 22:02:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 1046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:02:52,270 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 22:02:52,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 1046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 22:02:52,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482447493] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 22:02:52,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 22:02:52,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 46 [2024-06-27 22:02:52,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918710300] [2024-06-27 22:02:52,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 22:02:52,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-06-27 22:02:52,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 22:02:52,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-06-27 22:02:52,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=1703, Unknown=0, NotChecked=0, Total=2162 [2024-06-27 22:02:52,879 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-27 22:02:52,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 791 transitions, 21358 flow. Second operand has 47 states, 47 states have (on average 8.957446808510639) internal successors, (421), 47 states have internal predecessors, (421), 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:02:52,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 22:02:52,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-27 22:02:52,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 22:03:04,780 INFO L124 PetriNetUnfolderBase]: 8911/17911 cut-off events. [2024-06-27 22:03:04,781 INFO L125 PetriNetUnfolderBase]: For 10345964/10345964 co-relation queries the response was YES. [2024-06-27 22:03:04,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282921 conditions, 17911 events. 8911/17911 cut-off events. For 10345964/10345964 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 123226 event pairs, 136 based on Foata normal form. 18/17922 useless extension candidates. Maximal degree in co-relation 282705. Up to 4471 conditions per place. [2024-06-27 22:03:05,061 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 340 selfloop transitions, 737 changer transitions 171/1253 dead transitions. [2024-06-27 22:03:05,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 1253 transitions, 41089 flow [2024-06-27 22:03:05,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-06-27 22:03:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2024-06-27 22:03:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 1183 transitions. [2024-06-27 22:03:05,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48563218390804597 [2024-06-27 22:03:05,064 INFO L175 Difference]: Start difference. First operand has 613 places, 791 transitions, 21358 flow. Second operand 84 states and 1183 transitions. [2024-06-27 22:03:05,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 1253 transitions, 41089 flow [2024-06-27 22:03:54,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 628 places, 1253 transitions, 37709 flow, removed 1235 selfloop flow, removed 61 redundant places. [2024-06-27 22:03:54,937 INFO L231 Difference]: Finished difference. Result has 632 places, 795 transitions, 20490 flow [2024-06-27 22:03:54,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=18554, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=791, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=733, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=20490, PETRI_PLACES=632, PETRI_TRANSITIONS=795} [2024-06-27 22:03:54,938 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 601 predicate places. [2024-06-27 22:03:54,938 INFO L495 AbstractCegarLoop]: Abstraction has has 632 places, 795 transitions, 20490 flow [2024-06-27 22:03:54,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 8.957446808510639) internal successors, (421), 47 states have internal predecessors, (421), 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:03:54,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 22:03:54,938 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:54,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-06-27 22:03:55,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-06-27 22:03:55,139 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-27 22:03:55,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 22:03:55,140 INFO L85 PathProgramCache]: Analyzing trace with hash -2055219094, now seen corresponding path program 10 times [2024-06-27 22:03:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 22:03:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613512033] [2024-06-27 22:03:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 22:03:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 22:03:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:03:55,154 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 22:03:55,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 22:03:55,202 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 22:03:55,202 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 22:03:55,203 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-27 22:03:55,204 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-27 22:03:55,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-27 22:03:55,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-27 22:03:55,205 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-27 22:03:55,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-27 22:03:55,205 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 22:03:55,211 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 22:03:55,211 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 22:03:55,324 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 22:03:55,325 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 22:03:55,325 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 10:03:55 BasicIcfg [2024-06-27 22:03:55,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 22:03:55,326 INFO L158 Benchmark]: Toolchain (without parser) took 250855.12ms. Allocated memory was 155.2MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 82.2MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 22:03:55,326 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 79.4MB in the end (delta: 83.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:03:55,326 INFO L158 Benchmark]: Witness Parser took 0.13ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 123.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 22:03:55,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 364.42ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 118.8MB in the end (delta: -36.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-06-27 22:03:55,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:03:55,327 INFO L158 Benchmark]: Boogie Preprocessor took 35.71ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 115.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 22:03:55,327 INFO L158 Benchmark]: RCFGBuilder took 322.44ms. Allocated memory is still 155.2MB. Free memory was 114.6MB in the beginning and 96.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-27 22:03:55,327 INFO L158 Benchmark]: TraceAbstraction took 250100.17ms. Allocated memory was 155.2MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 95.2MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-06-27 22:03:55,329 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.14ms. Allocated memory is still 117.4MB. Free memory was 79.4MB in the beginning and 79.4MB in the end (delta: 83.6kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.13ms. Allocated memory is still 155.2MB. Free memory was 84.8MB in the beginning and 84.7MB in the end (delta: 123.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 364.42ms. Allocated memory is still 155.2MB. Free memory was 82.0MB in the beginning and 118.8MB in the end (delta: -36.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 155.2MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.71ms. Allocated memory is still 155.2MB. Free memory was 116.7MB in the beginning and 115.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 322.44ms. Allocated memory is still 155.2MB. Free memory was 114.6MB in the beginning and 96.2MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 250100.17ms. Allocated memory was 155.2MB in the beginning and 6.0GB in the end (delta: 5.8GB). Free memory was 95.2MB in the beginning and 4.6GB in the end (delta: -4.5GB). Peak memory consumption was 1.3GB. 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 < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, 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=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ 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] [L696] COND TRUE 1 k < 20 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] [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] [L704] COND TRUE 2 k < 20 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] [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 < 20 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 < 20 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] [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] [L696] COND TRUE 1 k < 20 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] [L704] COND TRUE 2 k < 20 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] [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] [L696] COND TRUE 1 k < 20 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] [L704] COND TRUE 2 k < 20 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] [L696] COND TRUE 1 k < 20 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] [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] [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] [L704] COND TRUE 2 k < 20 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] [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] [L696] COND TRUE 1 k < 20 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] [L696] COND TRUE 1 k < 20 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 < 20 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] [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] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 20 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] [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] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 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] [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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, 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=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [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=43, id1=-1, id2=0, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +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=43, id1=-1, id2=0, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +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=45, id1=-1, id2=0, j=46, k=19, k=19] [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=45, id1=-1, id2=0, j=46, k=19, k=19] [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=45, id1=-1, id2=0, j=46, k=19, k=19] - 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: 249.9s, OverallIterations: 17, TraceHistogramMax: 20, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 236.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 13407 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13294 mSDsluCounter, 584 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 558 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12519 IncrementalHoareTripleChecker+Invalid, 13242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 26 mSDtfsCounter, 12519 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2425 GetRequests, 1255 SyntacticMatches, 38 SemanticMatches, 1132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45800 ImplicationChecksByTransitivity, 15.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21933occurred in iteration=14, InterpolantAutomatonStates: 767, 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.4s SatisfiabilityAnalysisTime, 10.1s InterpolantComputationTime, 1693 NumberOfCodeBlocks, 1693 NumberOfCodeBlocksAsserted, 87 NumberOfCheckSat, 2269 ConstructedInterpolants, 0 QuantifiedInterpolants, 9219 SizeOfPredicates, 214 NumberOfNonLiveVariables, 1850 ConjunctsInSsa, 268 ConjunctsInUnsatCore, 36 InterpolantComputations, 6 PerfectInterpolantSequences, 25/11793 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:03:55,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 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