./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/triangular-longer-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/triangular-longer-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:14:49,580 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:14:49,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-28 01:14:49,647 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:14:49,648 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:14:49,675 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:14:49,676 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:14:49,676 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:14:49,677 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:14:49,680 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:14:49,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:14:49,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:14:49,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:14:49,682 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:14:49,683 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:14:49,683 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:14:49,683 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:14:49,683 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:14:49,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:14:49,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:14:49,684 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:14:49,684 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:14:49,684 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:14:49,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:14:49,685 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:14:49,685 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:14:49,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:14:49,685 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:14:49,686 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:14:49,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:14:49,687 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:14:49,687 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:14:49,687 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:14:49,687 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:14:49,688 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:14:49,689 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:14:49,689 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:14:49,689 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-28 01:14:49,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:14:49,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:14:49,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:14:49,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:14:49,932 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:14:49,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-06-28 01:14:51,022 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:14:51,268 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:14:51,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-06-28 01:14:51,282 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8833e4137/91a45cedd3df46df933349e23258cb98/FLAG6dbe64c2b [2024-06-28 01:14:51,295 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8833e4137/91a45cedd3df46df933349e23258cb98 [2024-06-28 01:14:51,297 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:14:51,297 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:14:51,300 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-nonrel/triangular-longer-2.yml/witness.yml [2024-06-28 01:14:51,385 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:14:51,386 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:14:51,387 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:14:51,387 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:14:51,391 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:14:51,392 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:14:51" (1/2) ... [2024-06-28 01:14:51,392 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cec9a7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:14:51, skipping insertion in model container [2024-06-28 01:14:51,392 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:14:51" (1/2) ... [2024-06-28 01:14:51,393 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@25a73d20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:14:51, skipping insertion in model container [2024-06-28 01:14:51,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:14:51" (2/2) ... [2024-06-28 01:14:51,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cec9a7e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51, skipping insertion in model container [2024-06-28 01:14:51,394 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:14:51" (2/2) ... [2024-06-28 01:14:51,394 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:14:51,418 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:14:51,419 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] ((! multithreaded || (4 <= j && j % 2 == 0)) && (! multithreaded || (((3 <= i && 4 <= j) && i % 2 == 1) && j % 2 == 0))) && (! multithreaded || (3 <= i && i % 2 == 1)) [2024-06-28 01:14:51,419 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] ((! multithreaded || (4 <= j && j % 2 == 0)) && (! multithreaded || (((3 <= i && 4 <= j) && i % 2 == 1) && j % 2 == 0))) && (! multithreaded || (3 <= i && i % 2 == 1)) [2024-06-28 01:14:51,420 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:14:51,420 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-06-28 01:14:51,453 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:14:51,784 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-06-28 01:14:51,788 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:14:51,794 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:14:51,879 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-06-28 01:14:51,882 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:14:51,915 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:14:51,915 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51 WrapperNode [2024-06-28 01:14:51,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:14:51,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:14:51,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:14:51,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:14:51,921 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 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:51,932 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 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:51,948 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-06-28 01:14:51,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:14:51,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:14:51,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:14:51,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:14:51,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:51,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:51,977 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,013 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-28 01:14:52,014 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,036 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:14:52,043 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:14:52,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:14:52,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:14:52,044 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (1/1) ... [2024-06-28 01:14:52,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:14:52,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:14:52,094 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-28 01:14:52,112 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-28 01:14:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-28 01:14:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-28 01:14:52,127 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-28 01:14:52,127 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-28 01:14:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:14:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:14:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:14:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:14:52,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:14:52,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:14:52,130 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-28 01:14:52,261 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:14:52,263 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:14:52,445 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:14:52,445 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:14:52,520 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:14:52,520 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-28 01:14:52,520 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:14:52 BoogieIcfgContainer [2024-06-28 01:14:52,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:14:52,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:14:52,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:14:52,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:14:52,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:14:51" (1/4) ... [2024-06-28 01:14:52,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f52b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:14:52, skipping insertion in model container [2024-06-28 01:14:52,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:14:51" (2/4) ... [2024-06-28 01:14:52,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f52b4b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:14:52, skipping insertion in model container [2024-06-28 01:14:52,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:14:51" (3/4) ... [2024-06-28 01:14:52,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f52b4b and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:14:52, skipping insertion in model container [2024-06-28 01:14:52,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:14:52" (4/4) ... [2024-06-28 01:14:52,528 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-06-28 01:14:52,544 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:14:52,544 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:14:52,544 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:14:52,592 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:14:52,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 66 flow [2024-06-28 01:14:52,648 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-28 01:14:52,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:14:52,651 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-28 01:14:52,652 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 66 flow [2024-06-28 01:14:52,655 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 60 flow [2024-06-28 01:14:52,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:14:52,676 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;@60b223c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:14:52,676 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:14:52,682 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:14:52,683 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:14:52,683 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:14:52,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:52,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:14:52,684 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-28 01:14:52,690 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash 176651994, now seen corresponding path program 1 times [2024-06-28 01:14:52,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:52,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227351074] [2024-06-28 01:14:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:53,272 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-28 01:14:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227351074] [2024-06-28 01:14:53,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227351074] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:53,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:53,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:14:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46897599] [2024-06-28 01:14:53,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:53,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:14:53,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:53,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:14:53,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:14:53,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-28 01:14:53,330 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-28 01:14:53,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:53,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-28 01:14:53,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:53,433 INFO L124 PetriNetUnfolderBase]: 172/337 cut-off events. [2024-06-28 01:14:53,433 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:14:53,434 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-28 01:14:53,436 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2024-06-28 01:14:53,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 139 flow [2024-06-28 01:14:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:14:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:14:53,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-28 01:14:53,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-06-28 01:14:53,447 INFO L175 Difference]: Start difference. First operand has 31 places, 27 transitions, 60 flow. Second operand 3 states and 65 transitions. [2024-06-28 01:14:53,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 139 flow [2024-06-28 01:14:53,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 136 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:14:53,451 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 75 flow [2024-06-28 01:14:53,452 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-28 01:14:53,454 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-28 01:14:53,455 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 75 flow [2024-06-28 01:14:53,455 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-28 01:14:53,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:53,455 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:53,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:14:53,456 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-28 01:14:53,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:53,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1314428841, now seen corresponding path program 1 times [2024-06-28 01:14:53,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:53,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365349461] [2024-06-28 01:14:53,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:53,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:53,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:53,686 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-28 01:14:53,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:53,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365349461] [2024-06-28 01:14:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365349461] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:53,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:53,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:14:53,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523423881] [2024-06-28 01:14:53,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:53,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:14:53,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:53,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:14:53,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:14:53,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-28 01:14:53,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 27 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-28 01:14:53,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:53,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-28 01:14:53,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:53,788 INFO L124 PetriNetUnfolderBase]: 160/331 cut-off events. [2024-06-28 01:14:53,788 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-28 01:14:53,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 709 conditions, 331 events. 160/331 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1438 event pairs, 37 based on Foata normal form. 21/342 useless extension candidates. Maximal degree in co-relation 697. Up to 109 conditions per place. [2024-06-28 01:14:53,790 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-06-28 01:14:53,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 199 flow [2024-06-28 01:14:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:14:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:14:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-28 01:14:53,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6620689655172414 [2024-06-28 01:14:53,792 INFO L175 Difference]: Start difference. First operand has 32 places, 27 transitions, 75 flow. Second operand 5 states and 96 transitions. [2024-06-28 01:14:53,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 199 flow [2024-06-28 01:14:53,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-28 01:14:53,794 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 98 flow [2024-06-28 01:14:53,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=35, PETRI_TRANSITIONS=28} [2024-06-28 01:14:53,795 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-28 01:14:53,795 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 98 flow [2024-06-28 01:14:53,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-28 01:14:53,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:53,795 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:53,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:14:53,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:14:53,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1917013662, now seen corresponding path program 1 times [2024-06-28 01:14:53,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:53,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142306098] [2024-06-28 01:14:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:53,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:53,932 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-28 01:14:53,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:53,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142306098] [2024-06-28 01:14:53,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142306098] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:53,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:53,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:14:53,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478054946] [2024-06-28 01:14:53,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:53,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:14:53,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:53,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:14:53,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:14:53,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:53,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 28 transitions, 98 flow. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-28 01:14:53,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:53,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:53,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:54,051 INFO L124 PetriNetUnfolderBase]: 244/502 cut-off events. [2024-06-28 01:14:54,051 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-06-28 01:14:54,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1133 conditions, 502 events. 244/502 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2451 event pairs, 88 based on Foata normal form. 18/504 useless extension candidates. Maximal degree in co-relation 1117. Up to 255 conditions per place. [2024-06-28 01:14:54,054 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 27 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2024-06-28 01:14:54,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 184 flow [2024-06-28 01:14:54,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:14:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:14:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-28 01:14:54,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-06-28 01:14:54,056 INFO L175 Difference]: Start difference. First operand has 35 places, 28 transitions, 98 flow. Second operand 5 states and 74 transitions. [2024-06-28 01:14:54,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 184 flow [2024-06-28 01:14:54,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 178 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-28 01:14:54,058 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 103 flow [2024-06-28 01:14:54,058 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=37, PETRI_TRANSITIONS=28} [2024-06-28 01:14:54,059 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-28 01:14:54,059 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 103 flow [2024-06-28 01:14:54,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-28 01:14:54,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:54,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:14:54,060 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-28 01:14:54,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:54,060 INFO L85 PathProgramCache]: Analyzing trace with hash 344931938, now seen corresponding path program 1 times [2024-06-28 01:14:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:54,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020279729] [2024-06-28 01:14:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:54,140 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-28 01:14:54,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020279729] [2024-06-28 01:14:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020279729] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:14:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465428705] [2024-06-28 01:14:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:54,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:14:54,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:54,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:14:54,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:14:54,161 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:54,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 28 transitions, 103 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-28 01:14:54,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:54,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:54,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:54,283 INFO L124 PetriNetUnfolderBase]: 532/914 cut-off events. [2024-06-28 01:14:54,283 INFO L125 PetriNetUnfolderBase]: For 795/795 co-relation queries the response was YES. [2024-06-28 01:14:54,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2269 conditions, 914 events. 532/914 cut-off events. For 795/795 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 4083 event pairs, 145 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 2252. Up to 397 conditions per place. [2024-06-28 01:14:54,287 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 30 selfloop transitions, 6 changer transitions 24/65 dead transitions. [2024-06-28 01:14:54,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 366 flow [2024-06-28 01:14:54,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:14:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:14:54,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2024-06-28 01:14:54,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6091954022988506 [2024-06-28 01:14:54,292 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 103 flow. Second operand 6 states and 106 transitions. [2024-06-28 01:14:54,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 366 flow [2024-06-28 01:14:54,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 359 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:14:54,296 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 137 flow [2024-06-28 01:14:54,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2024-06-28 01:14:54,297 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2024-06-28 01:14:54,297 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 137 flow [2024-06-28 01:14:54,298 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-28 01:14:54,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:54,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:54,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:14:54,298 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-28 01:14:54,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:54,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2107222436, now seen corresponding path program 1 times [2024-06-28 01:14:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:54,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725872458] [2024-06-28 01:14:54,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:54,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:54,426 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-28 01:14:54,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:54,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725872458] [2024-06-28 01:14:54,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725872458] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:54,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:14:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512652768] [2024-06-28 01:14:54,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:54,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:14:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:54,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:14:54,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:14:54,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:54,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 137 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-28 01:14:54,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:54,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:54,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:54,663 INFO L124 PetriNetUnfolderBase]: 496/889 cut-off events. [2024-06-28 01:14:54,663 INFO L125 PetriNetUnfolderBase]: For 980/980 co-relation queries the response was YES. [2024-06-28 01:14:54,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 889 events. 496/889 cut-off events. For 980/980 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4135 event pairs, 136 based on Foata normal form. 27/909 useless extension candidates. Maximal degree in co-relation 2404. Up to 373 conditions per place. [2024-06-28 01:14:54,668 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 50 selfloop transitions, 10 changer transitions 24/89 dead transitions. [2024-06-28 01:14:54,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 89 transitions, 511 flow [2024-06-28 01:14:54,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:14:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:14:54,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 172 transitions. [2024-06-28 01:14:54,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.593103448275862 [2024-06-28 01:14:54,670 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 137 flow. Second operand 10 states and 172 transitions. [2024-06-28 01:14:54,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 89 transitions, 511 flow [2024-06-28 01:14:54,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 89 transitions, 494 flow, removed 6 selfloop flow, removed 3 redundant places. [2024-06-28 01:14:54,676 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 201 flow [2024-06-28 01:14:54,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=201, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2024-06-28 01:14:54,677 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 22 predicate places. [2024-06-28 01:14:54,677 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 201 flow [2024-06-28 01:14:54,677 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-28 01:14:54,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:54,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:54,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:14:54,678 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-28 01:14:54,678 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:54,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1447649696, now seen corresponding path program 2 times [2024-06-28 01:14:54,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:54,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014818261] [2024-06-28 01:14:54,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:54,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:54,738 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-28 01:14:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014818261] [2024-06-28 01:14:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014818261] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:54,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:54,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:14:54,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642154259] [2024-06-28 01:14:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:54,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:14:54,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:54,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:14:54,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:14:54,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:54,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 201 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-28 01:14:54,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:54,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:54,886 INFO L124 PetriNetUnfolderBase]: 442/805 cut-off events. [2024-06-28 01:14:54,887 INFO L125 PetriNetUnfolderBase]: For 1997/1997 co-relation queries the response was YES. [2024-06-28 01:14:54,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 805 events. 442/805 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3612 event pairs, 160 based on Foata normal form. 27/825 useless extension candidates. Maximal degree in co-relation 2515. Up to 442 conditions per place. [2024-06-28 01:14:54,891 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 41 selfloop transitions, 13 changer transitions 27/86 dead transitions. [2024-06-28 01:14:54,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 86 transitions, 606 flow [2024-06-28 01:14:54,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-28 01:14:54,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-28 01:14:54,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 151 transitions. [2024-06-28 01:14:54,892 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.578544061302682 [2024-06-28 01:14:54,892 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 201 flow. Second operand 9 states and 151 transitions. [2024-06-28 01:14:54,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 86 transitions, 606 flow [2024-06-28 01:14:54,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 86 transitions, 583 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-06-28 01:14:54,896 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 313 flow [2024-06-28 01:14:54,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=313, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2024-06-28 01:14:54,897 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 31 predicate places. [2024-06-28 01:14:54,897 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 313 flow [2024-06-28 01:14:54,897 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-28 01:14:54,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:54,898 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-28 01:14:54,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:14:54,898 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-28 01:14:54,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:54,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1033578543, now seen corresponding path program 1 times [2024-06-28 01:14:54,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:54,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345778658] [2024-06-28 01:14:54,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:54,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:54,965 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-28 01:14:54,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:54,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345778658] [2024-06-28 01:14:54,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345778658] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:14:54,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:14:54,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:14:54,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026829218] [2024-06-28 01:14:54,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:14:54,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:14:54,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:54,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:14:54,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:14:55,008 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:55,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 313 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:14:55,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:55,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:55,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:55,178 INFO L124 PetriNetUnfolderBase]: 424/785 cut-off events. [2024-06-28 01:14:55,179 INFO L125 PetriNetUnfolderBase]: For 2720/2720 co-relation queries the response was YES. [2024-06-28 01:14:55,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 785 events. 424/785 cut-off events. For 2720/2720 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3432 event pairs, 76 based on Foata normal form. 27/799 useless extension candidates. Maximal degree in co-relation 2639. Up to 223 conditions per place. [2024-06-28 01:14:55,182 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 43 selfloop transitions, 19 changer transitions 28/95 dead transitions. [2024-06-28 01:14:55,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 740 flow [2024-06-28 01:14:55,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:14:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:14:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 01:14:55,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5724137931034483 [2024-06-28 01:14:55,184 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 313 flow. Second operand 10 states and 166 transitions. [2024-06-28 01:14:55,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 740 flow [2024-06-28 01:14:55,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 95 transitions, 717 flow, removed 8 selfloop flow, removed 4 redundant places. [2024-06-28 01:14:55,192 INFO L231 Difference]: Finished difference. Result has 70 places, 46 transitions, 403 flow [2024-06-28 01:14:55,192 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=403, PETRI_PLACES=70, PETRI_TRANSITIONS=46} [2024-06-28 01:14:55,193 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 39 predicate places. [2024-06-28 01:14:55,193 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 46 transitions, 403 flow [2024-06-28 01:14:55,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:14:55,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:55,193 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-28 01:14:55,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:14:55,194 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-28 01:14:55,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1338349260, now seen corresponding path program 1 times [2024-06-28 01:14:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:55,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014078095] [2024-06-28 01:14:55,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:55,265 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-28 01:14:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014078095] [2024-06-28 01:14:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014078095] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:14:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181097052] [2024-06-28 01:14:55,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:55,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:14:55,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:14:55,268 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-28 01:14:55,273 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-28 01:14:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:55,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:14:55,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:14:55,391 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-28 01:14:55,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:14:55,464 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-28 01:14:55,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181097052] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:14:55,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:14:55,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-06-28 01:14:55,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855635329] [2024-06-28 01:14:55,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:14:55,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-06-28 01:14:55,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:55,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-06-28 01:14:55,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-06-28 01:14:55,554 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:55,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 46 transitions, 403 flow. Second operand has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 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-28 01:14:55,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:55,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:55,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:55,914 INFO L124 PetriNetUnfolderBase]: 640/1166 cut-off events. [2024-06-28 01:14:55,914 INFO L125 PetriNetUnfolderBase]: For 6513/6513 co-relation queries the response was YES. [2024-06-28 01:14:55,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4352 conditions, 1166 events. 640/1166 cut-off events. For 6513/6513 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5223 event pairs, 64 based on Foata normal form. 45/1198 useless extension candidates. Maximal degree in co-relation 4316. Up to 265 conditions per place. [2024-06-28 01:14:55,921 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 65 selfloop transitions, 34 changer transitions 56/160 dead transitions. [2024-06-28 01:14:55,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 160 transitions, 1351 flow [2024-06-28 01:14:55,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-28 01:14:55,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-28 01:14:55,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 313 transitions. [2024-06-28 01:14:55,923 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5680580762250453 [2024-06-28 01:14:55,923 INFO L175 Difference]: Start difference. First operand has 70 places, 46 transitions, 403 flow. Second operand 19 states and 313 transitions. [2024-06-28 01:14:55,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 160 transitions, 1351 flow [2024-06-28 01:14:55,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 160 transitions, 1262 flow, removed 33 selfloop flow, removed 8 redundant places. [2024-06-28 01:14:55,934 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 701 flow [2024-06-28 01:14:55,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=701, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2024-06-28 01:14:55,935 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-28 01:14:55,935 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 701 flow [2024-06-28 01:14:55,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.214285714285714) internal successors, (157), 14 states have internal predecessors, (157), 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-28 01:14:55,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:55,936 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:55,948 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-28 01:14:56,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:14:56,148 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-28 01:14:56,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -768213302, now seen corresponding path program 1 times [2024-06-28 01:14:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:56,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097438119] [2024-06-28 01:14:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:14:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097438119] [2024-06-28 01:14:56,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097438119] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:14:56,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236233404] [2024-06-28 01:14:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:56,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:14:56,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:14:56,273 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-28 01:14:56,295 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-28 01:14:56,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:56,322 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-28 01:14:56,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:14:56,368 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:14:56,369 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:14:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:14:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [236233404] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:14:56,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:14:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-28 01:14:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588643657] [2024-06-28 01:14:56,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:14:56,485 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-28 01:14:56,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:56,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-28 01:14:56,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-06-28 01:14:56,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:56,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 62 transitions, 701 flow. Second operand has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 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-28 01:14:56,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:56,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:56,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:57,297 INFO L124 PetriNetUnfolderBase]: 1324/2454 cut-off events. [2024-06-28 01:14:57,298 INFO L125 PetriNetUnfolderBase]: For 21518/21518 co-relation queries the response was YES. [2024-06-28 01:14:57,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10496 conditions, 2454 events. 1324/2454 cut-off events. For 21518/21518 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12878 event pairs, 136 based on Foata normal form. 81/2528 useless extension candidates. Maximal degree in co-relation 10455. Up to 589 conditions per place. [2024-06-28 01:14:57,313 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 128 selfloop transitions, 67 changer transitions 91/291 dead transitions. [2024-06-28 01:14:57,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 291 transitions, 3146 flow [2024-06-28 01:14:57,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-28 01:14:57,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-28 01:14:57,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 523 transitions. [2024-06-28 01:14:57,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635775862068966 [2024-06-28 01:14:57,316 INFO L175 Difference]: Start difference. First operand has 87 places, 62 transitions, 701 flow. Second operand 32 states and 523 transitions. [2024-06-28 01:14:57,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 291 transitions, 3146 flow [2024-06-28 01:14:57,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 291 transitions, 2379 flow, removed 364 selfloop flow, removed 11 redundant places. [2024-06-28 01:14:57,347 INFO L231 Difference]: Finished difference. Result has 125 places, 108 transitions, 1226 flow [2024-06-28 01:14:57,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1226, PETRI_PLACES=125, PETRI_TRANSITIONS=108} [2024-06-28 01:14:57,347 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-28 01:14:57,348 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 108 transitions, 1226 flow [2024-06-28 01:14:57,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.411764705882353) internal successors, (194), 17 states have internal predecessors, (194), 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-28 01:14:57,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:57,348 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:57,363 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-28 01:14:57,560 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,SelfDestructingSolverStorable8 [2024-06-28 01:14:57,561 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-28 01:14:57,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1478704196, now seen corresponding path program 2 times [2024-06-28 01:14:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:57,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394716728] [2024-06-28 01:14:57,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:57,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:14:57,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394716728] [2024-06-28 01:14:57,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394716728] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:14:57,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581475072] [2024-06-28 01:14:57,664 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:14:57,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:14:57,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:14:57,668 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-28 01:14:57,693 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-28 01:14:57,716 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:14:57,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:14:57,717 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-28 01:14:57,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:14:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:14:57,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:14:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:14:57,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581475072] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:14:57,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:14:57,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-28 01:14:57,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701580077] [2024-06-28 01:14:57,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:14:57,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-28 01:14:57,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:57,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-28 01:14:57,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-06-28 01:14:57,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:57,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 108 transitions, 1226 flow. Second operand has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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-28 01:14:57,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:57,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:57,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:14:58,832 INFO L124 PetriNetUnfolderBase]: 1918/3533 cut-off events. [2024-06-28 01:14:58,833 INFO L125 PetriNetUnfolderBase]: For 85928/85928 co-relation queries the response was YES. [2024-06-28 01:14:58,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18144 conditions, 3533 events. 1918/3533 cut-off events. For 85928/85928 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 20248 event pairs, 112 based on Foata normal form. 117/3643 useless extension candidates. Maximal degree in co-relation 18086. Up to 715 conditions per place. [2024-06-28 01:14:58,857 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 132 selfloop transitions, 114 changer transitions 113/364 dead transitions. [2024-06-28 01:14:58,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 364 transitions, 4687 flow [2024-06-28 01:14:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-06-28 01:14:58,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2024-06-28 01:14:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 572 transitions. [2024-06-28 01:14:58,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635467980295567 [2024-06-28 01:14:58,859 INFO L175 Difference]: Start difference. First operand has 125 places, 108 transitions, 1226 flow. Second operand 35 states and 572 transitions. [2024-06-28 01:14:58,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 364 transitions, 4687 flow [2024-06-28 01:14:59,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 364 transitions, 4051 flow, removed 304 selfloop flow, removed 14 redundant places. [2024-06-28 01:14:59,070 INFO L231 Difference]: Finished difference. Result has 158 places, 155 transitions, 2129 flow [2024-06-28 01:14:59,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=2129, PETRI_PLACES=158, PETRI_TRANSITIONS=155} [2024-06-28 01:14:59,071 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 127 predicate places. [2024-06-28 01:14:59,071 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 155 transitions, 2129 flow [2024-06-28 01:14:59,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.470588235294118) internal successors, (195), 17 states have internal predecessors, (195), 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-28 01:14:59,072 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:14:59,072 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:14:59,094 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-28 01:14:59,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:14:59,284 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-28 01:14:59,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:14:59,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1924986963, now seen corresponding path program 3 times [2024-06-28 01:14:59,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:14:59,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556008213] [2024-06-28 01:14:59,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:14:59,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:14:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:14:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:14:59,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:14:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556008213] [2024-06-28 01:14:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556008213] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:14:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399550297] [2024-06-28 01:14:59,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:14:59,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:14:59,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:14:59,471 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-28 01:14:59,497 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-28 01:14:59,544 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-06-28 01:14:59,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:14:59,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-28 01:14:59,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:14:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:14:59,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:14:59,757 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:14:59,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399550297] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:14:59,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:14:59,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-06-28 01:14:59,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367076934] [2024-06-28 01:14:59,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:14:59,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-06-28 01:14:59,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:14:59,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-06-28 01:14:59,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-06-28 01:14:59,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:14:59,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 155 transitions, 2129 flow. Second operand has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 26 states have internal predecessors, (289), 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-28 01:14:59,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:14:59,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:14:59,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:01,742 INFO L124 PetriNetUnfolderBase]: 3241/5883 cut-off events. [2024-06-28 01:15:01,743 INFO L125 PetriNetUnfolderBase]: For 240073/240073 co-relation queries the response was YES. [2024-06-28 01:15:01,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37393 conditions, 5883 events. 3241/5883 cut-off events. For 240073/240073 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 34032 event pairs, 58 based on Foata normal form. 117/5993 useless extension candidates. Maximal degree in co-relation 37323. Up to 1207 conditions per place. [2024-06-28 01:15:01,786 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 173 selfloop transitions, 207 changer transitions 164/549 dead transitions. [2024-06-28 01:15:01,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 549 transitions, 9562 flow [2024-06-28 01:15:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-06-28 01:15:01,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-06-28 01:15:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 866 transitions. [2024-06-28 01:15:01,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5634352635003254 [2024-06-28 01:15:01,789 INFO L175 Difference]: Start difference. First operand has 158 places, 155 transitions, 2129 flow. Second operand 53 states and 866 transitions. [2024-06-28 01:15:01,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 549 transitions, 9562 flow [2024-06-28 01:15:02,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 549 transitions, 7969 flow, removed 763 selfloop flow, removed 20 redundant places. [2024-06-28 01:15:02,244 INFO L231 Difference]: Finished difference. Result has 213 places, 261 transitions, 4646 flow [2024-06-28 01:15:02,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4646, PETRI_PLACES=213, PETRI_TRANSITIONS=261} [2024-06-28 01:15:02,245 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 182 predicate places. [2024-06-28 01:15:02,245 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 261 transitions, 4646 flow [2024-06-28 01:15:02,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 11.115384615384615) internal successors, (289), 26 states have internal predecessors, (289), 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-28 01:15:02,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:02,246 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:02,260 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-28 01:15:02,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:02,459 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-28 01:15:02,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:02,459 INFO L85 PathProgramCache]: Analyzing trace with hash -293836576, now seen corresponding path program 4 times [2024-06-28 01:15:02,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:02,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890325860] [2024-06-28 01:15:02,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:02,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:02,845 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:02,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890325860] [2024-06-28 01:15:02,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890325860] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:02,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035935325] [2024-06-28 01:15:02,845 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 01:15:02,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:02,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:02,846 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-28 01:15:02,848 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-28 01:15:02,907 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 01:15:02,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:02,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:02,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:03,048 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:03,426 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 202 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-06-28 01:15:03,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035935325] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:03,426 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:03,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-28 01:15:03,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257397381] [2024-06-28 01:15:03,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:03,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-28 01:15:03,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:03,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-28 01:15:03,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=1305, Unknown=0, NotChecked=0, Total=1640 [2024-06-28 01:15:03,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:03,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 261 transitions, 4646 flow. Second operand has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-28 01:15:03,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:03,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:03,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:06,224 INFO L124 PetriNetUnfolderBase]: 3637/6941 cut-off events. [2024-06-28 01:15:06,224 INFO L125 PetriNetUnfolderBase]: For 430246/430246 co-relation queries the response was YES. [2024-06-28 01:15:06,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47837 conditions, 6941 events. 3637/6941 cut-off events. For 430246/430246 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 43349 event pairs, 864 based on Foata normal form. 63/6997 useless extension candidates. Maximal degree in co-relation 47744. Up to 3565 conditions per place. [2024-06-28 01:15:06,295 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 344 selfloop transitions, 132 changer transitions 135/616 dead transitions. [2024-06-28 01:15:06,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 616 transitions, 12520 flow [2024-06-28 01:15:06,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-06-28 01:15:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-06-28 01:15:06,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 828 transitions. [2024-06-28 01:15:06,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.538711776187378 [2024-06-28 01:15:06,299 INFO L175 Difference]: Start difference. First operand has 213 places, 261 transitions, 4646 flow. Second operand 53 states and 828 transitions. [2024-06-28 01:15:06,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 616 transitions, 12520 flow [2024-06-28 01:15:07,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 616 transitions, 8339 flow, removed 2061 selfloop flow, removed 22 redundant places. [2024-06-28 01:15:07,374 INFO L231 Difference]: Finished difference. Result has 249 places, 317 transitions, 4502 flow [2024-06-28 01:15:07,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3169, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4502, PETRI_PLACES=249, PETRI_TRANSITIONS=317} [2024-06-28 01:15:07,375 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 218 predicate places. [2024-06-28 01:15:07,375 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 317 transitions, 4502 flow [2024-06-28 01:15:07,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-28 01:15:07,376 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:07,376 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:07,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:07,587 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,SelfDestructingSolverStorable11 [2024-06-28 01:15:07,588 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-28 01:15:07,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:07,588 INFO L85 PathProgramCache]: Analyzing trace with hash 551863886, now seen corresponding path program 5 times [2024-06-28 01:15:07,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:07,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999171362] [2024-06-28 01:15:07,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:07,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:07,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:07,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:07,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999171362] [2024-06-28 01:15:07,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999171362] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:07,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393033050] [2024-06-28 01:15:07,911 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 01:15:07,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:07,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:07,912 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-28 01:15:07,924 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-28 01:15:07,993 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2024-06-28 01:15:07,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:07,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:08,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:08,129 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:08,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393033050] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:08,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-28 01:15:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631715296] [2024-06-28 01:15:08,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:08,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-28 01:15:08,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:08,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-28 01:15:08,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1375, Unknown=0, NotChecked=0, Total=1640 [2024-06-28 01:15:08,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:08,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 317 transitions, 4502 flow. Second operand has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-28 01:15:08,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:08,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:08,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:11,817 INFO L124 PetriNetUnfolderBase]: 4933/9726 cut-off events. [2024-06-28 01:15:11,818 INFO L125 PetriNetUnfolderBase]: For 552049/552049 co-relation queries the response was YES. [2024-06-28 01:15:11,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58686 conditions, 9726 events. 4933/9726 cut-off events. For 552049/552049 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 65520 event pairs, 232 based on Foata normal form. 81/9800 useless extension candidates. Maximal degree in co-relation 58587. Up to 1549 conditions per place. [2024-06-28 01:15:11,900 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 268 selfloop transitions, 374 changer transitions 157/804 dead transitions. [2024-06-28 01:15:11,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 804 transitions, 12958 flow [2024-06-28 01:15:11,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-28 01:15:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-28 01:15:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 934 transitions. [2024-06-28 01:15:11,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5458796025715955 [2024-06-28 01:15:11,912 INFO L175 Difference]: Start difference. First operand has 249 places, 317 transitions, 4502 flow. Second operand 59 states and 934 transitions. [2024-06-28 01:15:11,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 804 transitions, 12958 flow [2024-06-28 01:15:13,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 804 transitions, 11935 flow, removed 432 selfloop flow, removed 29 redundant places. [2024-06-28 01:15:13,728 INFO L231 Difference]: Finished difference. Result has 297 places, 456 transitions, 7409 flow [2024-06-28 01:15:13,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3945, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=247, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=7409, PETRI_PLACES=297, PETRI_TRANSITIONS=456} [2024-06-28 01:15:13,729 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 266 predicate places. [2024-06-28 01:15:13,730 INFO L495 AbstractCegarLoop]: Abstraction has has 297 places, 456 transitions, 7409 flow [2024-06-28 01:15:13,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-28 01:15:13,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:13,730 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:13,742 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-28 01:15:13,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:13,942 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-28 01:15:13,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:13,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1935927198, now seen corresponding path program 6 times [2024-06-28 01:15:13,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:13,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899683244] [2024-06-28 01:15:13,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:13,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:14,376 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899683244] [2024-06-28 01:15:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899683244] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771278974] [2024-06-28 01:15:14,377 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-28 01:15:14,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:14,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:14,378 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-28 01:15:14,396 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-28 01:15:14,456 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-06-28 01:15:14,457 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:14,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:14,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:14,577 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:14,578 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:14,934 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:14,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771278974] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:14,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:14,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-06-28 01:15:14,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017997218] [2024-06-28 01:15:14,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:14,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-06-28 01:15:14,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:14,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-06-28 01:15:14,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2024-06-28 01:15:15,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-28 01:15:15,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 456 transitions, 7409 flow. Second operand has 42 states, 42 states have (on average 9.214285714285714) internal successors, (387), 42 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:15,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:15,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-28 01:15:15,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:19,365 INFO L124 PetriNetUnfolderBase]: 6049/11939 cut-off events. [2024-06-28 01:15:19,365 INFO L125 PetriNetUnfolderBase]: For 945101/945101 co-relation queries the response was YES. [2024-06-28 01:15:19,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80050 conditions, 11939 events. 6049/11939 cut-off events. For 945101/945101 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 84218 event pairs, 118 based on Foata normal form. 81/12013 useless extension candidates. Maximal degree in co-relation 79931. Up to 1903 conditions per place. [2024-06-28 01:15:19,472 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 265 selfloop transitions, 479 changer transitions 155/904 dead transitions. [2024-06-28 01:15:19,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 904 transitions, 16349 flow [2024-06-28 01:15:19,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-28 01:15:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-28 01:15:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 826 transitions. [2024-06-28 01:15:19,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2024-06-28 01:15:19,474 INFO L175 Difference]: Start difference. First operand has 297 places, 456 transitions, 7409 flow. Second operand 59 states and 826 transitions. [2024-06-28 01:15:19,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 904 transitions, 16349 flow [2024-06-28 01:15:22,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 904 transitions, 14782 flow, removed 737 selfloop flow, removed 22 redundant places. [2024-06-28 01:15:22,734 INFO L231 Difference]: Finished difference. Result has 351 places, 554 transitions, 9702 flow [2024-06-28 01:15:22,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6402, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=395, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=9702, PETRI_PLACES=351, PETRI_TRANSITIONS=554} [2024-06-28 01:15:22,735 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 320 predicate places. [2024-06-28 01:15:22,735 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 554 transitions, 9702 flow [2024-06-28 01:15:22,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 9.214285714285714) internal successors, (387), 42 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:22,735 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:22,735 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:22,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-06-28 01:15:22,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:22,947 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-28 01:15:22,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:22,947 INFO L85 PathProgramCache]: Analyzing trace with hash -212495846, now seen corresponding path program 7 times [2024-06-28 01:15:22,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:22,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625126552] [2024-06-28 01:15:22,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:22,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:22,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625126552] [2024-06-28 01:15:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625126552] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092258101] [2024-06-28 01:15:23,256 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-28 01:15:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:23,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:23,258 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-28 01:15:23,259 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-28 01:15:23,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:23,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:23,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:23,382 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:23,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 201 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:23,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092258101] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:23,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:23,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-28 01:15:23,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801476284] [2024-06-28 01:15:23,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:23,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-28 01:15:23,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:23,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-28 01:15:23,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=361, Invalid=1279, Unknown=0, NotChecked=0, Total=1640 [2024-06-28 01:15:23,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:23,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 554 transitions, 9702 flow. Second operand has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-28 01:15:23,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:23,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:23,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:28,540 INFO L124 PetriNetUnfolderBase]: 6742/13212 cut-off events. [2024-06-28 01:15:28,540 INFO L125 PetriNetUnfolderBase]: For 1498314/1498314 co-relation queries the response was YES. [2024-06-28 01:15:28,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100847 conditions, 13212 events. 6742/13212 cut-off events. For 1498314/1498314 co-relation queries the response was YES. Maximal size of possible extension queue 217. Compared 93955 event pairs, 62 based on Foata normal form. 81/13286 useless extension candidates. Maximal degree in co-relation 100710. Up to 2119 conditions per place. [2024-06-28 01:15:28,677 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 258 selfloop transitions, 543 changer transitions 149/955 dead transitions. [2024-06-28 01:15:28,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 955 transitions, 19323 flow [2024-06-28 01:15:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2024-06-28 01:15:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2024-06-28 01:15:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 958 transitions. [2024-06-28 01:15:28,680 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.559906487434249 [2024-06-28 01:15:28,680 INFO L175 Difference]: Start difference. First operand has 351 places, 554 transitions, 9702 flow. Second operand 59 states and 958 transitions. [2024-06-28 01:15:28,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 955 transitions, 19323 flow [2024-06-28 01:15:33,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 955 transitions, 16861 flow, removed 989 selfloop flow, removed 34 redundant places. [2024-06-28 01:15:33,567 INFO L231 Difference]: Finished difference. Result has 387 places, 611 transitions, 11245 flow [2024-06-28 01:15:33,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=8058, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=497, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=59, PETRI_FLOW=11245, PETRI_PLACES=387, PETRI_TRANSITIONS=611} [2024-06-28 01:15:33,568 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 356 predicate places. [2024-06-28 01:15:33,569 INFO L495 AbstractCegarLoop]: Abstraction has has 387 places, 611 transitions, 11245 flow [2024-06-28 01:15:33,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 11.195121951219512) internal successors, (459), 41 states have internal predecessors, (459), 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-28 01:15:33,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:33,569 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:33,581 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-28 01:15:33,781 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,SelfDestructingSolverStorable14 [2024-06-28 01:15:33,781 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-28 01:15:33,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:33,782 INFO L85 PathProgramCache]: Analyzing trace with hash 246150633, now seen corresponding path program 8 times [2024-06-28 01:15:33,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:33,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399580857] [2024-06-28 01:15:33,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:33,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:33,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:34,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:34,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399580857] [2024-06-28 01:15:34,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399580857] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:34,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141972868] [2024-06-28 01:15:34,045 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:15:34,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:34,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:34,047 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-28 01:15:34,048 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-28 01:15:34,099 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:15:34,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:34,101 INFO L262 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 25 conjunts are in the unsatisfiable core [2024-06-28 01:15:34,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:34,195 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-28 01:15:34,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141972868] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:34,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:34,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 42 [2024-06-28 01:15:34,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624378022] [2024-06-28 01:15:34,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:34,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-06-28 01:15:34,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-06-28 01:15:34,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1413, Unknown=0, NotChecked=0, Total=1806 [2024-06-28 01:15:34,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-28 01:15:34,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 611 transitions, 11245 flow. Second operand has 43 states, 43 states have (on average 9.186046511627907) internal successors, (395), 43 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:34,600 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:34,600 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-28 01:15:34,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:39,133 INFO L124 PetriNetUnfolderBase]: 7039/13834 cut-off events. [2024-06-28 01:15:39,133 INFO L125 PetriNetUnfolderBase]: For 1836173/1836173 co-relation queries the response was YES. [2024-06-28 01:15:39,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109545 conditions, 13834 events. 7039/13834 cut-off events. For 1836173/1836173 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 98650 event pairs, 282 based on Foata normal form. 63/13884 useless extension candidates. Maximal degree in co-relation 109396. Up to 2239 conditions per place. [2024-06-28 01:15:39,302 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 246 selfloop transitions, 535 changer transitions 111/897 dead transitions. [2024-06-28 01:15:39,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 897 transitions, 18857 flow [2024-06-28 01:15:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-06-28 01:15:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2024-06-28 01:15:39,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 665 transitions. [2024-06-28 01:15:39,304 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48789435069699194 [2024-06-28 01:15:39,304 INFO L175 Difference]: Start difference. First operand has 387 places, 611 transitions, 11245 flow. Second operand 47 states and 665 transitions. [2024-06-28 01:15:39,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 897 transitions, 18857 flow [2024-06-28 01:15:46,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 897 transitions, 15210 flow, removed 1424 selfloop flow, removed 45 redundant places. [2024-06-28 01:15:46,287 INFO L231 Difference]: Finished difference. Result has 390 places, 642 transitions, 11013 flow [2024-06-28 01:15:46,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=9032, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=508, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=11013, PETRI_PLACES=390, PETRI_TRANSITIONS=642} [2024-06-28 01:15:46,289 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 359 predicate places. [2024-06-28 01:15:46,289 INFO L495 AbstractCegarLoop]: Abstraction has has 390 places, 642 transitions, 11013 flow [2024-06-28 01:15:46,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 9.186046511627907) internal successors, (395), 43 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:15:46,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:46,290 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:46,304 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-28 01:15:46,501 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,SelfDestructingSolverStorable15 [2024-06-28 01:15:46,502 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-28 01:15:46,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -973799792, now seen corresponding path program 9 times [2024-06-28 01:15:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855863234] [2024-06-28 01:15:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:15:46,512 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:15:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:15:46,551 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:15:46,552 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:15:46,552 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-28 01:15:46,553 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-28 01:15:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-28 01:15:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-28 01:15:46,554 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-28 01:15:46,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-06-28 01:15:46,554 INFO L445 BasicCegarLoop]: Path program histogram: [9, 2, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:46,558 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:15:46,558 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:15:46,663 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:15:46,663 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:15:46,663 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:15:46 BasicIcfg [2024-06-28 01:15:46,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:15:46,669 INFO L158 Benchmark]: Toolchain (without parser) took 55282.56ms. Allocated memory was 176.2MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 111.0MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-06-28 01:15:46,669 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 96.5MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:15:46,669 INFO L158 Benchmark]: Witness Parser took 0.41ms. Allocated memory is still 176.2MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:15:46,669 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.38ms. Allocated memory is still 176.2MB. Free memory was 110.6MB in the beginning and 129.5MB in the end (delta: -18.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-06-28 01:15:46,669 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.98ms. Allocated memory is still 176.2MB. Free memory was 129.5MB in the beginning and 127.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:15:46,670 INFO L158 Benchmark]: Boogie Preprocessor took 91.86ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:15:46,670 INFO L158 Benchmark]: RCFGBuilder took 477.14ms. Allocated memory is still 176.2MB. Free memory was 125.3MB in the beginning and 105.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-06-28 01:15:46,670 INFO L158 Benchmark]: TraceAbstraction took 54145.20ms. Allocated memory was 176.2MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 103.6MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-06-28 01:15:46,671 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 96.5MB. Free memory is still 45.5MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.41ms. Allocated memory is still 176.2MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 528.38ms. Allocated memory is still 176.2MB. Free memory was 110.6MB in the beginning and 129.5MB in the end (delta: -18.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.98ms. Allocated memory is still 176.2MB. Free memory was 129.5MB in the beginning and 127.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.86ms. Allocated memory is still 176.2MB. Free memory was 127.4MB in the beginning and 125.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 477.14ms. Allocated memory is still 176.2MB. Free memory was 125.3MB in the beginning and 105.0MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 54145.20ms. Allocated memory was 176.2MB in the beginning and 8.1GB in the end (delta: 8.0GB). Free memory was 103.6MB in the beginning and 6.5GB in the end (delta: -6.4GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, arg={0:0}, i=7, j=6, k=0] [L714] 0 //@ assert (((!multithreaded || ((4 <= j) && ((j % 2) == 0))) && (!multithreaded || ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)))) && (!multithreaded || ((3 <= i) && ((i % 2) == 1)))); [L714] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, argc=51, i=7, id1=-1, id2=0, j=6, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, i=7, j=6, k=1] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [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 < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=5, k=6] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=7] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=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 < 10 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 < 10 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] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L715] 0 //@ assert (((!multithreaded || ((4 <= j) && ((j % 2) == 0))) && (!multithreaded || ((((3 <= i) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)))) && (!multithreaded || ((3 <= i) && ((i % 2) == 1)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=23, id1=-1, id2=0, j=24, k=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] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1=-1, id2=0, j=24, k=9, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1=-1, id2=0, j=26, k=9, k=9] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 53.9s, OverallIterations: 17, TraceHistogramMax: 10, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 44.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7366 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7253 mSDsluCounter, 314 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 306 mSDsCounter, 394 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10590 IncrementalHoareTripleChecker+Invalid, 10984 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 394 mSolverCounterUnsat, 8 mSDtfsCounter, 10590 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1445 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 672 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15051 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11245occurred in iteration=15, InterpolantAutomatonStates: 464, 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, 6.0s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 1409 ConstructedInterpolants, 0 QuantifiedInterpolants, 6006 SizeOfPredicates, 117 NumberOfNonLiveVariables, 1340 ConjunctsInSsa, 165 ConjunctsInUnsatCore, 34 InterpolantComputations, 7 PerfectInterpolantSequences, 39/3345 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-28 01:15:46,695 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