./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/triangular-longest-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longest-2.i ./goblint.2024-06-19_11-23-25.files/mutex-meet-nonrel/triangular-longest-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-28 01:14:58,320 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-28 01:14:58,384 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:58,389 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-28 01:14:58,389 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-28 01:14:58,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-28 01:14:58,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-28 01:14:58,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-28 01:14:58,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-28 01:14:58,416 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-28 01:14:58,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-28 01:14:58,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-28 01:14:58,418 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-28 01:14:58,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-28 01:14:58,419 INFO L153 SettingsManager]: * Use SBE=true [2024-06-28 01:14:58,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-28 01:14:58,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-28 01:14:58,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-28 01:14:58,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-28 01:14:58,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-28 01:14:58,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-28 01:14:58,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-28 01:14:58,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-28 01:14:58,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-28 01:14:58,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-28 01:14:58,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-28 01:14:58,421 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-28 01:14:58,421 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-28 01:14:58,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-28 01:14:58,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-28 01:14:58,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-28 01:14:58,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-28 01:14:58,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:14:58,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-28 01:14:58,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-28 01:14:58,424 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-28 01:14:58,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-28 01:14:58,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-28 01:14:58,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-28 01:14:58,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-28 01:14:58,425 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-28 01:14:58,425 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-28 01:14:58,425 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-28 01:14:58,425 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:58,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-28 01:14:58,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-28 01:14:58,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-28 01:14:58,671 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-28 01:14:58,672 INFO L274 PluginConnector]: CDTParser initialized [2024-06-28 01:14:58,673 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-06-28 01:14:59,787 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-28 01:14:59,968 INFO L384 CDTParser]: Found 1 translation units. [2024-06-28 01:14:59,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2024-06-28 01:14:59,983 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf85e857/d054292da48c46108a5a8aef0fb6a53a/FLAGb56bfcebd [2024-06-28 01:14:59,993 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1cf85e857/d054292da48c46108a5a8aef0fb6a53a [2024-06-28 01:14:59,995 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-28 01:14:59,997 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-28 01:14:59,997 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-longest-2.yml/witness.yml [2024-06-28 01:15:00,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-28 01:15:00,081 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-28 01:15:00,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-28 01:15:00,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-28 01:15:00,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-28 01:15:00,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:14:59" (1/2) ... [2024-06-28 01:15:00,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3d278e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:00, skipping insertion in model container [2024-06-28 01:15:00,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.06 01:14:59" (1/2) ... [2024-06-28 01:15:00,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4db44252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.06 01:15:00, skipping insertion in model container [2024-06-28 01:15:00,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:00" (2/2) ... [2024-06-28 01:15:00,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d3d278e and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:00, skipping insertion in model container [2024-06-28 01:15:00,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:00" (2/2) ... [2024-06-28 01:15:00,091 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-28 01:15:00,119 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-28 01:15:00,120 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:15:00,120 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:15:00,120 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-28 01:15:00,121 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-06-28 01:15:00,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-28 01:15:00,451 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-06-28 01:15:00,456 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:00,462 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-28 01:15:00,627 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i[30964,30977] [2024-06-28 01:15:00,635 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-28 01:15:00,689 INFO L206 MainTranslator]: Completed translation [2024-06-28 01:15:00,690 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 28.06 01:15:00 WrapperNode [2024-06-28 01:15:00,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-28 01:15:00,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-28 01:15:00,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-28 01:15:00,692 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-28 01:15:00,703 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:15:00" (1/1) ... [2024-06-28 01:15:00,747 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:15:00" (1/1) ... [2024-06-28 01:15:00,770 INFO L138 Inliner]: procedures = 168, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 42 [2024-06-28 01:15:00,771 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-28 01:15:00,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-28 01:15:00,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-28 01:15:00,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-28 01:15:00,781 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:15:00" (1/1) ... [2024-06-28 01:15:00,781 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:15:00" (1/1) ... [2024-06-28 01:15:00,786 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:15:00" (1/1) ... [2024-06-28 01:15:00,808 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:15:00,808 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:15:00" (1/1) ... [2024-06-28 01:15:00,808 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:15:00" (1/1) ... [2024-06-28 01:15:00,818 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:15:00" (1/1) ... [2024-06-28 01:15:00,823 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:15:00" (1/1) ... [2024-06-28 01:15:00,825 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:15:00" (1/1) ... [2024-06-28 01:15:00,826 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:15:00" (1/1) ... [2024-06-28 01:15:00,831 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-28 01:15:00,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-28 01:15:00,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-28 01:15:00,832 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-28 01:15:00,832 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:15:00" (1/1) ... [2024-06-28 01:15:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-28 01:15:00,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:00,857 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:15:00,875 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:15:00,886 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-28 01:15:00,886 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-28 01:15:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-28 01:15:00,887 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-28 01:15:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-06-28 01:15:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-28 01:15:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-28 01:15:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-06-28 01:15:00,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-28 01:15:00,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-28 01:15:00,888 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:15:00,987 INFO L244 CfgBuilder]: Building ICFG [2024-06-28 01:15:00,988 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-28 01:15:01,141 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-28 01:15:01,141 INFO L293 CfgBuilder]: Performing block encoding [2024-06-28 01:15:01,199 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-28 01:15:01,199 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-28 01:15:01,200 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.06 01:15:01 BoogieIcfgContainer [2024-06-28 01:15:01,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-28 01:15:01,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-28 01:15:01,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-28 01:15:01,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-28 01:15:01,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.06 01:14:59" (1/4) ... [2024-06-28 01:15:01,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20825b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.06 01:15:01, skipping insertion in model container [2024-06-28 01:15:01,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 28.06 01:15:00" (2/4) ... [2024-06-28 01:15:01,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20825b92 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:15:01, skipping insertion in model container [2024-06-28 01:15:01,205 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:15:00" (3/4) ... [2024-06-28 01:15:01,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20825b92 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 28.06 01:15:01, skipping insertion in model container [2024-06-28 01:15:01,205 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:15:01" (4/4) ... [2024-06-28 01:15:01,206 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2024-06-28 01:15:01,220 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-28 01:15:01,220 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-28 01:15:01,220 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-28 01:15:01,256 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-06-28 01:15:01,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 33 places, 29 transitions, 66 flow [2024-06-28 01:15:01,307 INFO L124 PetriNetUnfolderBase]: 3/27 cut-off events. [2024-06-28 01:15:01,311 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:15:01,315 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:15:01,315 INFO L82 GeneralOperation]: Start removeDead. Operand has 33 places, 29 transitions, 66 flow [2024-06-28 01:15:01,318 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 27 transitions, 60 flow [2024-06-28 01:15:01,332 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-28 01:15:01,339 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;@14f0b229, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-28 01:15:01,339 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-06-28 01:15:01,348 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-28 01:15:01,348 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-06-28 01:15:01,348 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-28 01:15:01,349 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:01,349 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-06-28 01:15:01,353 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:15:01,361 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:01,361 INFO L85 PathProgramCache]: Analyzing trace with hash 176651994, now seen corresponding path program 1 times [2024-06-28 01:15:01,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:01,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226403499] [2024-06-28 01:15:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:01,975 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:15:01,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:01,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226403499] [2024-06-28 01:15:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226403499] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:01,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:01,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-28 01:15:01,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732255027] [2024-06-28 01:15:01,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:01,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-28 01:15:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:02,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-28 01:15:02,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-28 01:15:02,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-28 01:15:02,035 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:15:02,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:02,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-28 01:15:02,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:02,142 INFO L124 PetriNetUnfolderBase]: 172/337 cut-off events. [2024-06-28 01:15:02,145 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-06-28 01:15:02,146 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:15:02,150 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 23 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2024-06-28 01:15:02,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 37 transitions, 139 flow [2024-06-28 01:15:02,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-28 01:15:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-28 01:15:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2024-06-28 01:15:02,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7471264367816092 [2024-06-28 01:15:02,161 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:15:02,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 37 transitions, 139 flow [2024-06-28 01:15:02,164 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:15:02,165 INFO L231 Difference]: Finished difference. Result has 32 places, 27 transitions, 75 flow [2024-06-28 01:15:02,167 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:15:02,170 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2024-06-28 01:15:02,170 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 27 transitions, 75 flow [2024-06-28 01:15:02,171 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:15:02,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:02,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:02,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-28 01:15:02,171 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:15:02,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:02,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1314428841, now seen corresponding path program 1 times [2024-06-28 01:15:02,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:02,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991362947] [2024-06-28 01:15:02,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:02,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:02,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:02,365 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:15:02,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:02,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991362947] [2024-06-28 01:15:02,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991362947] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:02,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:02,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-28 01:15:02,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777488857] [2024-06-28 01:15:02,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:02,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-28 01:15:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:02,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-28 01:15:02,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-28 01:15:02,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 29 [2024-06-28 01:15:02,396 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:15:02,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:02,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 29 [2024-06-28 01:15:02,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:02,519 INFO L124 PetriNetUnfolderBase]: 160/331 cut-off events. [2024-06-28 01:15:02,520 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-06-28 01:15:02,521 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:15:02,522 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 33 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2024-06-28 01:15:02,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 199 flow [2024-06-28 01:15:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:15:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:15:02,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 96 transitions. [2024-06-28 01:15:02,531 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6620689655172414 [2024-06-28 01:15:02,531 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:15:02,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 199 flow [2024-06-28 01:15:02,532 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:15:02,533 INFO L231 Difference]: Finished difference. Result has 35 places, 28 transitions, 98 flow [2024-06-28 01:15:02,533 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:15:02,534 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-06-28 01:15:02,534 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 28 transitions, 98 flow [2024-06-28 01:15:02,534 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:15:02,534 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:02,534 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:02,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-28 01:15:02,535 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:15:02,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1917013662, now seen corresponding path program 1 times [2024-06-28 01:15:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:02,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643854289] [2024-06-28 01:15:02,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:02,664 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:15:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:02,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643854289] [2024-06-28 01:15:02,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643854289] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:02,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:02,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-28 01:15:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539748571] [2024-06-28 01:15:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:02,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:02,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:02,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:02,683 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:15:02,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:02,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:02,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:02,776 INFO L124 PetriNetUnfolderBase]: 244/502 cut-off events. [2024-06-28 01:15:02,777 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-06-28 01:15:02,778 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:15:02,780 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 27 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2024-06-28 01:15:02,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 38 transitions, 184 flow [2024-06-28 01:15:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-06-28 01:15:02,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-06-28 01:15:02,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2024-06-28 01:15:02,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5103448275862069 [2024-06-28 01:15:02,782 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:15:02,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 38 transitions, 184 flow [2024-06-28 01:15:02,783 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:15:02,784 INFO L231 Difference]: Finished difference. Result has 37 places, 28 transitions, 103 flow [2024-06-28 01:15:02,784 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:15:02,784 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2024-06-28 01:15:02,785 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 28 transitions, 103 flow [2024-06-28 01:15:02,785 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:15:02,785 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:02,785 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:02,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-28 01:15:02,786 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:15:02,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash 344931938, now seen corresponding path program 1 times [2024-06-28 01:15:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:02,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60582128] [2024-06-28 01:15:02,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:02,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:02,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:02,857 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:15:02,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:02,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60582128] [2024-06-28 01:15:02,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60582128] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:02,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:02,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-28 01:15:02,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286745394] [2024-06-28 01:15:02,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:02,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-28 01:15:02,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:02,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-28 01:15:02,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-28 01:15:02,877 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:02,877 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:15:02,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:02,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:02,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:03,026 INFO L124 PetriNetUnfolderBase]: 595/1023 cut-off events. [2024-06-28 01:15:03,027 INFO L125 PetriNetUnfolderBase]: For 918/918 co-relation queries the response was YES. [2024-06-28 01:15:03,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2549 conditions, 1023 events. 595/1023 cut-off events. For 918/918 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4733 event pairs, 178 based on Foata normal form. 0/980 useless extension candidates. Maximal degree in co-relation 2532. Up to 544 conditions per place. [2024-06-28 01:15:03,032 INFO L140 encePairwiseOnDemand]: 22/29 looper letters, 34 selfloop transitions, 7 changer transitions 31/77 dead transitions. [2024-06-28 01:15:03,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 77 transitions, 416 flow [2024-06-28 01:15:03,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:15:03,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:15:03,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2024-06-28 01:15:03,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6077586206896551 [2024-06-28 01:15:03,034 INFO L175 Difference]: Start difference. First operand has 37 places, 28 transitions, 103 flow. Second operand 8 states and 141 transitions. [2024-06-28 01:15:03,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 77 transitions, 416 flow [2024-06-28 01:15:03,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 77 transitions, 409 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-28 01:15:03,037 INFO L231 Difference]: Finished difference. Result has 48 places, 31 transitions, 158 flow [2024-06-28 01:15:03,037 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=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=31} [2024-06-28 01:15:03,038 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2024-06-28 01:15:03,038 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 31 transitions, 158 flow [2024-06-28 01:15:03,038 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:15:03,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:03,038 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:03,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-28 01:15:03,039 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:15:03,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 654878447, now seen corresponding path program 1 times [2024-06-28 01:15:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990983721] [2024-06-28 01:15:03,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:03,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:03,116 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:15:03,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:03,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990983721] [2024-06-28 01:15:03,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990983721] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:03,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:03,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:15:03,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801346865] [2024-06-28 01:15:03,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:03,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:03,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:03,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:03,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:03,148 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:03,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 31 transitions, 158 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:15:03,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:03,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:03,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:03,274 INFO L124 PetriNetUnfolderBase]: 397/721 cut-off events. [2024-06-28 01:15:03,274 INFO L125 PetriNetUnfolderBase]: For 1105/1105 co-relation queries the response was YES. [2024-06-28 01:15:03,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 721 events. 397/721 cut-off events. For 1105/1105 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 3147 event pairs, 151 based on Foata normal form. 27/735 useless extension candidates. Maximal degree in co-relation 2041. Up to 400 conditions per place. [2024-06-28 01:15:03,278 INFO L140 encePairwiseOnDemand]: 24/29 looper letters, 30 selfloop transitions, 8 changer transitions 16/59 dead transitions. [2024-06-28 01:15:03,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 380 flow [2024-06-28 01:15:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-28 01:15:03,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-28 01:15:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 101 transitions. [2024-06-28 01:15:03,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5804597701149425 [2024-06-28 01:15:03,281 INFO L175 Difference]: Start difference. First operand has 48 places, 31 transitions, 158 flow. Second operand 6 states and 101 transitions. [2024-06-28 01:15:03,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 380 flow [2024-06-28 01:15:03,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 59 transitions, 360 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-06-28 01:15:03,289 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 190 flow [2024-06-28 01:15:03,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2024-06-28 01:15:03,295 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 18 predicate places. [2024-06-28 01:15:03,296 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 190 flow [2024-06-28 01:15:03,296 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:15:03,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:03,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:03,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-28 01:15:03,300 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:15:03,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:03,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1435421146, now seen corresponding path program 1 times [2024-06-28 01:15:03,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:03,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285273488] [2024-06-28 01:15:03,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:03,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:03,395 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:15:03,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:03,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285273488] [2024-06-28 01:15:03,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285273488] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:03,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:03,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-06-28 01:15:03,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874820902] [2024-06-28 01:15:03,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:03,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-06-28 01:15:03,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:03,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-06-28 01:15:03,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-06-28 01:15:03,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:03,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 190 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:15:03,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:03,431 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:03,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:03,560 INFO L124 PetriNetUnfolderBase]: 379/682 cut-off events. [2024-06-28 01:15:03,560 INFO L125 PetriNetUnfolderBase]: For 1190/1190 co-relation queries the response was YES. [2024-06-28 01:15:03,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 682 events. 379/682 cut-off events. For 1190/1190 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2864 event pairs, 115 based on Foata normal form. 27/702 useless extension candidates. Maximal degree in co-relation 2038. Up to 364 conditions per place. [2024-06-28 01:15:03,564 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 39 selfloop transitions, 9 changer transitions 24/77 dead transitions. [2024-06-28 01:15:03,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 492 flow [2024-06-28 01:15:03,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-06-28 01:15:03,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-06-28 01:15:03,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 137 transitions. [2024-06-28 01:15:03,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5905172413793104 [2024-06-28 01:15:03,565 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 190 flow. Second operand 8 states and 137 transitions. [2024-06-28 01:15:03,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 492 flow [2024-06-28 01:15:03,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 465 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-06-28 01:15:03,569 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 233 flow [2024-06-28 01:15:03,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=169, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=233, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2024-06-28 01:15:03,569 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2024-06-28 01:15:03,569 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 233 flow [2024-06-28 01:15:03,570 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:15:03,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:03,570 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:15:03,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-28 01:15:03,570 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:15:03,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:03,571 INFO L85 PathProgramCache]: Analyzing trace with hash 259230455, now seen corresponding path program 1 times [2024-06-28 01:15:03,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:03,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563381391] [2024-06-28 01:15:03,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:03,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:03,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:03,636 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:15:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563381391] [2024-06-28 01:15:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563381391] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:15:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819261493] [2024-06-28 01:15:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:03,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:15:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:15:03,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:15:03,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:03,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 233 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:15:03,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:03,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:03,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:03,835 INFO L124 PetriNetUnfolderBase]: 352/644 cut-off events. [2024-06-28 01:15:03,836 INFO L125 PetriNetUnfolderBase]: For 1650/1650 co-relation queries the response was YES. [2024-06-28 01:15:03,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2091 conditions, 644 events. 352/644 cut-off events. For 1650/1650 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2592 event pairs, 70 based on Foata normal form. 27/658 useless extension candidates. Maximal degree in co-relation 2063. Up to 145 conditions per place. [2024-06-28 01:15:03,839 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 39 selfloop transitions, 16 changer transitions 28/88 dead transitions. [2024-06-28 01:15:03,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 88 transitions, 609 flow [2024-06-28 01:15:03,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-06-28 01:15:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-06-28 01:15:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 166 transitions. [2024-06-28 01:15:03,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5724137931034483 [2024-06-28 01:15:03,840 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 233 flow. Second operand 10 states and 166 transitions. [2024-06-28 01:15:03,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 88 transitions, 609 flow [2024-06-28 01:15:03,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 88 transitions, 594 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-06-28 01:15:03,844 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 309 flow [2024-06-28 01:15:03,844 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=309, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2024-06-28 01:15:03,845 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2024-06-28 01:15:03,845 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 309 flow [2024-06-28 01:15:03,845 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:15:03,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:03,845 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:15:03,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-28 01:15:03,846 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:15:03,846 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1320585101, now seen corresponding path program 2 times [2024-06-28 01:15:03,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:03,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693310698] [2024-06-28 01:15:03,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:03,910 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:15:03,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:03,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693310698] [2024-06-28 01:15:03,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693310698] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-28 01:15:03,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-28 01:15:03,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-06-28 01:15:03,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933601630] [2024-06-28 01:15:03,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-28 01:15:03,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-06-28 01:15:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:03,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-06-28 01:15:03,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-06-28 01:15:03,949 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:03,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 39 transitions, 309 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:15:03,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:03,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:03,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:04,134 INFO L124 PetriNetUnfolderBase]: 379/688 cut-off events. [2024-06-28 01:15:04,134 INFO L125 PetriNetUnfolderBase]: For 2662/2662 co-relation queries the response was YES. [2024-06-28 01:15:04,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 688 events. 379/688 cut-off events. For 2662/2662 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2902 event pairs, 106 based on Foata normal form. 18/699 useless extension candidates. Maximal degree in co-relation 2422. Up to 331 conditions per place. [2024-06-28 01:15:04,138 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 49 selfloop transitions, 14 changer transitions 25/93 dead transitions. [2024-06-28 01:15:04,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 93 transitions, 713 flow [2024-06-28 01:15:04,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-06-28 01:15:04,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-06-28 01:15:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 181 transitions. [2024-06-28 01:15:04,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.567398119122257 [2024-06-28 01:15:04,139 INFO L175 Difference]: Start difference. First operand has 64 places, 39 transitions, 309 flow. Second operand 11 states and 181 transitions. [2024-06-28 01:15:04,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 93 transitions, 713 flow [2024-06-28 01:15:04,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 93 transitions, 668 flow, removed 15 selfloop flow, removed 6 redundant places. [2024-06-28 01:15:04,145 INFO L231 Difference]: Finished difference. Result has 69 places, 42 transitions, 357 flow [2024-06-28 01:15:04,146 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=357, PETRI_PLACES=69, PETRI_TRANSITIONS=42} [2024-06-28 01:15:04,146 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 38 predicate places. [2024-06-28 01:15:04,146 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 42 transitions, 357 flow [2024-06-28 01:15:04,146 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:15:04,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:04,147 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:15:04,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-28 01:15:04,147 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:15:04,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:04,148 INFO L85 PathProgramCache]: Analyzing trace with hash -456201350, now seen corresponding path program 1 times [2024-06-28 01:15:04,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:04,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799062593] [2024-06-28 01:15:04,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:04,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:04,222 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:15:04,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799062593] [2024-06-28 01:15:04,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799062593] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:04,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228123843] [2024-06-28 01:15:04,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:04,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:04,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:04,225 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:15:04,254 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:15:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:04,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 9 conjunts are in the unsatisfiable core [2024-06-28 01:15:04,294 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:04,402 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:15:04,403 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:04,498 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:15:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228123843] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:04,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:04,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-06-28 01:15:04,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073917038] [2024-06-28 01:15:04,499 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:04,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-06-28 01:15:04,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:04,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-06-28 01:15:04,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-06-28 01:15:04,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:04,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 42 transitions, 357 flow. Second operand has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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:04,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:04,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:04,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:04,938 INFO L124 PetriNetUnfolderBase]: 613/1103 cut-off events. [2024-06-28 01:15:04,938 INFO L125 PetriNetUnfolderBase]: For 5933/5933 co-relation queries the response was YES. [2024-06-28 01:15:04,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4158 conditions, 1103 events. 613/1103 cut-off events. For 5933/5933 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4748 event pairs, 64 based on Foata normal form. 45/1135 useless extension candidates. Maximal degree in co-relation 4124. Up to 247 conditions per place. [2024-06-28 01:15:04,944 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 31 changer transitions 56/156 dead transitions. [2024-06-28 01:15:04,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 1297 flow [2024-06-28 01:15:04,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-06-28 01:15:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-06-28 01:15:04,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 313 transitions. [2024-06-28 01:15:04,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5680580762250453 [2024-06-28 01:15:04,947 INFO L175 Difference]: Start difference. First operand has 69 places, 42 transitions, 357 flow. Second operand 19 states and 313 transitions. [2024-06-28 01:15:04,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 1297 flow [2024-06-28 01:15:04,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 156 transitions, 1219 flow, removed 27 selfloop flow, removed 8 redundant places. [2024-06-28 01:15:04,958 INFO L231 Difference]: Finished difference. Result has 87 places, 58 transitions, 646 flow [2024-06-28 01:15:04,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=646, PETRI_PLACES=87, PETRI_TRANSITIONS=58} [2024-06-28 01:15:04,960 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 56 predicate places. [2024-06-28 01:15:04,960 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 58 transitions, 646 flow [2024-06-28 01:15:04,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 11.307692307692308) internal successors, (147), 13 states have internal predecessors, (147), 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:04,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:04,960 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:15:04,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-28 01:15:05,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:05,172 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:15:05,172 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:05,172 INFO L85 PathProgramCache]: Analyzing trace with hash -768213302, now seen corresponding path program 1 times [2024-06-28 01:15:05,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:05,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924682976] [2024-06-28 01:15:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:05,333 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:15:05,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924682976] [2024-06-28 01:15:05,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924682976] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:05,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015278896] [2024-06-28 01:15:05,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:05,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:05,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:05,335 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:15:05,337 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:15:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:05,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2024-06-28 01:15:05,388 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:05,443 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:15:05,444 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:05,570 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:15:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015278896] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:05,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-06-28 01:15:05,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693232680] [2024-06-28 01:15:05,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:05,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-06-28 01:15:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:05,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-06-28 01:15:05,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2024-06-28 01:15:05,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:05,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 58 transitions, 646 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:15:05,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:05,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:05,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:06,418 INFO L124 PetriNetUnfolderBase]: 1297/2391 cut-off events. [2024-06-28 01:15:06,418 INFO L125 PetriNetUnfolderBase]: For 21818/21818 co-relation queries the response was YES. [2024-06-28 01:15:06,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10436 conditions, 2391 events. 1297/2391 cut-off events. For 21818/21818 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 12385 event pairs, 136 based on Foata normal form. 81/2465 useless extension candidates. Maximal degree in co-relation 10395. Up to 571 conditions per place. [2024-06-28 01:15:06,436 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 127 selfloop transitions, 64 changer transitions 91/287 dead transitions. [2024-06-28 01:15:06,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 287 transitions, 3111 flow [2024-06-28 01:15:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-06-28 01:15:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-06-28 01:15:06,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 523 transitions. [2024-06-28 01:15:06,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5635775862068966 [2024-06-28 01:15:06,441 INFO L175 Difference]: Start difference. First operand has 87 places, 58 transitions, 646 flow. Second operand 32 states and 523 transitions. [2024-06-28 01:15:06,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 287 transitions, 3111 flow [2024-06-28 01:15:06,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 287 transitions, 2345 flow, removed 363 selfloop flow, removed 11 redundant places. [2024-06-28 01:15:06,486 INFO L231 Difference]: Finished difference. Result has 125 places, 104 transitions, 1152 flow [2024-06-28 01:15:06,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1152, PETRI_PLACES=125, PETRI_TRANSITIONS=104} [2024-06-28 01:15:06,488 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 94 predicate places. [2024-06-28 01:15:06,488 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 104 transitions, 1152 flow [2024-06-28 01:15:06,488 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:15:06,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:06,489 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:15:06,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-28 01:15:06,704 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,SelfDestructingSolverStorable9 [2024-06-28 01:15:06,705 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:15:06,706 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:06,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1740125296, now seen corresponding path program 2 times [2024-06-28 01:15:06,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:06,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334554172] [2024-06-28 01:15:06,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:06,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:06,867 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:15:06,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334554172] [2024-06-28 01:15:06,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334554172] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:06,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357305772] [2024-06-28 01:15:06,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:15:06,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:06,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:06,885 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:15:06,902 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:15:06,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:15:06,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:06,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2024-06-28 01:15:06,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:07,029 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:15:07,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:07,176 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:15:07,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357305772] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:07,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:07,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-06-28 01:15:07,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995926776] [2024-06-28 01:15:07,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:07,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-06-28 01:15:07,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-06-28 01:15:07,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2024-06-28 01:15:07,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:07,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 104 transitions, 1152 flow. Second operand has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 18 states have internal predecessors, (205), 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,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:07,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:07,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:08,183 INFO L124 PetriNetUnfolderBase]: 1684/3112 cut-off events. [2024-06-28 01:15:08,184 INFO L125 PetriNetUnfolderBase]: For 81721/81721 co-relation queries the response was YES. [2024-06-28 01:15:08,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16499 conditions, 3112 events. 1684/3112 cut-off events. For 81721/81721 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 17266 event pairs, 56 based on Foata normal form. 117/3222 useless extension candidates. Maximal degree in co-relation 16441. Up to 607 conditions per place. [2024-06-28 01:15:08,205 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 124 selfloop transitions, 105 changer transitions 115/349 dead transitions. [2024-06-28 01:15:08,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 349 transitions, 4581 flow [2024-06-28 01:15:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-06-28 01:15:08,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2024-06-28 01:15:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 589 transitions. [2024-06-28 01:15:08,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.564176245210728 [2024-06-28 01:15:08,208 INFO L175 Difference]: Start difference. First operand has 125 places, 104 transitions, 1152 flow. Second operand 36 states and 589 transitions. [2024-06-28 01:15:08,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 349 transitions, 4581 flow [2024-06-28 01:15:08,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 349 transitions, 3942 flow, removed 305 selfloop flow, removed 17 redundant places. [2024-06-28 01:15:08,331 INFO L231 Difference]: Finished difference. Result has 157 places, 139 transitions, 1940 flow [2024-06-28 01:15:08,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=973, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=71, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=1940, PETRI_PLACES=157, PETRI_TRANSITIONS=139} [2024-06-28 01:15:08,332 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 126 predicate places. [2024-06-28 01:15:08,332 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 139 transitions, 1940 flow [2024-06-28 01:15:08,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 11.38888888888889) internal successors, (205), 18 states have internal predecessors, (205), 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,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:08,332 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:15:08,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-06-28 01:15:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:08,543 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:08,544 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:08,544 INFO L85 PathProgramCache]: Analyzing trace with hash 482006665, now seen corresponding path program 3 times [2024-06-28 01:15:08,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:08,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658079617] [2024-06-28 01:15:08,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:08,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:08,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:08,695 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:15:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658079617] [2024-06-28 01:15:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658079617] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953730906] [2024-06-28 01:15:08,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:15:08,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:08,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:08,713 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:15:08,736 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:15:08,767 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-06-28 01:15:08,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:08,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2024-06-28 01:15:08,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:08,827 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:15:08,827 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:08,998 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:15:08,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953730906] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:08,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:08,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2024-06-28 01:15:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299253868] [2024-06-28 01:15:09,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:09,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-06-28 01:15:09,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:09,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-06-28 01:15:09,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2024-06-28 01:15:09,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:09,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 139 transitions, 1940 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:15:09,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:09,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:09,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:10,651 INFO L124 PetriNetUnfolderBase]: 2458/4491 cut-off events. [2024-06-28 01:15:10,651 INFO L125 PetriNetUnfolderBase]: For 202456/202456 co-relation queries the response was YES. [2024-06-28 01:15:10,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29504 conditions, 4491 events. 2458/4491 cut-off events. For 202456/202456 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 24179 event pairs, 58 based on Foata normal form. 99/4583 useless extension candidates. Maximal degree in co-relation 29433. Up to 901 conditions per place. [2024-06-28 01:15:10,692 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 166 selfloop transitions, 159 changer transitions 150/480 dead transitions. [2024-06-28 01:15:10,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 480 transitions, 8176 flow [2024-06-28 01:15:10,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-06-28 01:15:10,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-06-28 01:15:10,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 832 transitions. [2024-06-28 01:15:10,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625422582826234 [2024-06-28 01:15:10,694 INFO L175 Difference]: Start difference. First operand has 157 places, 139 transitions, 1940 flow. Second operand 51 states and 832 transitions. [2024-06-28 01:15:10,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 480 transitions, 8176 flow [2024-06-28 01:15:10,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 480 transitions, 6944 flow, removed 589 selfloop flow, removed 20 redundant places. [2024-06-28 01:15:10,919 INFO L231 Difference]: Finished difference. Result has 209 places, 196 transitions, 3320 flow [2024-06-28 01:15:10,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1560, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=105, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=3320, PETRI_PLACES=209, PETRI_TRANSITIONS=196} [2024-06-28 01:15:10,920 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 178 predicate places. [2024-06-28 01:15:10,920 INFO L495 AbstractCegarLoop]: Abstraction has has 209 places, 196 transitions, 3320 flow [2024-06-28 01:15:10,921 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:10,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:10,921 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:10,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-06-28 01:15:11,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:11,134 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:11,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2024846854, now seen corresponding path program 4 times [2024-06-28 01:15:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959941386] [2024-06-28 01:15:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:11,565 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:11,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959941386] [2024-06-28 01:15:11,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959941386] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:11,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762919656] [2024-06-28 01:15:11,566 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-28 01:15:11,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:11,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:11,567 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:11,588 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:11,645 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-28 01:15:11,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:11,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:11,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:11,788 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:11,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:12,235 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:12,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762919656] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:12,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:12,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-28 01:15:12,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519187862] [2024-06-28 01:15:12,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:12,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-28 01:15:12,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:12,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-28 01:15:12,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1288, Unknown=0, NotChecked=0, Total=1640 [2024-06-28 01:15:12,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:12,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 196 transitions, 3320 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:12,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:12,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:12,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:15,189 INFO L124 PetriNetUnfolderBase]: 3268/6243 cut-off events. [2024-06-28 01:15:15,189 INFO L125 PetriNetUnfolderBase]: For 597369/597369 co-relation queries the response was YES. [2024-06-28 01:15:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55107 conditions, 6243 events. 3268/6243 cut-off events. For 597369/597369 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 35188 event pairs, 610 based on Foata normal form. 189/6425 useless extension candidates. Maximal degree in co-relation 55014. Up to 2395 conditions per place. [2024-06-28 01:15:15,241 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 268 selfloop transitions, 142 changer transitions 235/650 dead transitions. [2024-06-28 01:15:15,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 650 transitions, 15649 flow [2024-06-28 01:15:15,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2024-06-28 01:15:15,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2024-06-28 01:15:15,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 1081 transitions. [2024-06-28 01:15:15,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481744421906694 [2024-06-28 01:15:15,244 INFO L175 Difference]: Start difference. First operand has 209 places, 196 transitions, 3320 flow. Second operand 68 states and 1081 transitions. [2024-06-28 01:15:15,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 650 transitions, 15649 flow [2024-06-28 01:15:16,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 650 transitions, 12309 flow, removed 1644 selfloop flow, removed 20 redundant places. [2024-06-28 01:15:16,056 INFO L231 Difference]: Finished difference. Result has 286 places, 265 transitions, 4956 flow [2024-06-28 01:15:16,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2488, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=4956, PETRI_PLACES=286, PETRI_TRANSITIONS=265} [2024-06-28 01:15:16,057 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 255 predicate places. [2024-06-28 01:15:16,057 INFO L495 AbstractCegarLoop]: Abstraction has has 286 places, 265 transitions, 4956 flow [2024-06-28 01:15:16,058 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:16,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:16,058 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:16,070 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:16,270 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,SelfDestructingSolverStorable12 [2024-06-28 01:15:16,270 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:16,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:16,271 INFO L85 PathProgramCache]: Analyzing trace with hash 77922374, now seen corresponding path program 5 times [2024-06-28 01:15:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662716162] [2024-06-28 01:15:16,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:16,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:16,614 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:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662716162] [2024-06-28 01:15:16,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662716162] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2086110494] [2024-06-28 01:15:16,615 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-28 01:15:16,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:16,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:16,629 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:16,632 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:16,730 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-06-28 01:15:16,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:16,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:16,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:16,849 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:16,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:17,317 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:17,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2086110494] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:17,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:17,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 40 [2024-06-28 01:15:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619366700] [2024-06-28 01:15:17,319 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-06-28 01:15:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:17,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-06-28 01:15:17,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=1342, Unknown=0, NotChecked=0, Total=1640 [2024-06-28 01:15:17,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:17,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 265 transitions, 4956 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:17,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:17,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:17,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:21,134 INFO L124 PetriNetUnfolderBase]: 4438/8779 cut-off events. [2024-06-28 01:15:21,134 INFO L125 PetriNetUnfolderBase]: For 1584889/1584889 co-relation queries the response was YES. [2024-06-28 01:15:21,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92140 conditions, 8779 events. 4438/8779 cut-off events. For 1584889/1584889 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 54974 event pairs, 212 based on Foata normal form. 189/8961 useless extension candidates. Maximal degree in co-relation 92017. Up to 2071 conditions per place. [2024-06-28 01:15:21,243 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 241 selfloop transitions, 327 changer transitions 251/824 dead transitions. [2024-06-28 01:15:21,243 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 824 transitions, 22313 flow [2024-06-28 01:15:21,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-06-28 01:15:21,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2024-06-28 01:15:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 1217 transitions. [2024-06-28 01:15:21,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5521778584392014 [2024-06-28 01:15:21,250 INFO L175 Difference]: Start difference. First operand has 286 places, 265 transitions, 4956 flow. Second operand 76 states and 1217 transitions. [2024-06-28 01:15:21,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 824 transitions, 22313 flow [2024-06-28 01:15:25,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 824 transitions, 18638 flow, removed 1798 selfloop flow, removed 37 redundant places. [2024-06-28 01:15:25,939 INFO L231 Difference]: Finished difference. Result has 350 places, 388 transitions, 8360 flow [2024-06-28 01:15:25,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3759, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=212, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=8360, PETRI_PLACES=350, PETRI_TRANSITIONS=388} [2024-06-28 01:15:25,940 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 319 predicate places. [2024-06-28 01:15:25,941 INFO L495 AbstractCegarLoop]: Abstraction has has 350 places, 388 transitions, 8360 flow [2024-06-28 01:15:25,941 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:25,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:25,941 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:25,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-06-28 01:15:26,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:26,156 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:26,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:26,156 INFO L85 PathProgramCache]: Analyzing trace with hash -2050437556, now seen corresponding path program 6 times [2024-06-28 01:15:26,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:26,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979942698] [2024-06-28 01:15:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:26,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:26,476 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:26,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:26,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979942698] [2024-06-28 01:15:26,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979942698] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:26,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761450746] [2024-06-28 01:15:26,476 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-06-28 01:15:26,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:26,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:26,489 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:26,490 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:26,546 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-06-28 01:15:26,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:15:26,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2024-06-28 01:15:26,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:26,659 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:26,660 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:27,087 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:27,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761450746] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:27,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:27,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2024-06-28 01:15:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577452582] [2024-06-28 01:15:27,088 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:27,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-06-28 01:15:27,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:27,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-06-28 01:15:27,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1408, Unknown=0, NotChecked=0, Total=1722 [2024-06-28 01:15:27,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:27,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 388 transitions, 8360 flow. Second operand has 42 states, 42 states have (on average 11.214285714285714) internal successors, (471), 42 states have internal predecessors, (471), 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:27,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:27,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:27,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:32,944 INFO L124 PetriNetUnfolderBase]: 5986/11692 cut-off events. [2024-06-28 01:15:32,945 INFO L125 PetriNetUnfolderBase]: For 3382371/3382371 co-relation queries the response was YES. [2024-06-28 01:15:33,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147001 conditions, 11692 events. 5986/11692 cut-off events. For 3382371/3382371 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 75903 event pairs, 90 based on Foata normal form. 198/11883 useless extension candidates. Maximal degree in co-relation 146851. Up to 2773 conditions per place. [2024-06-28 01:15:33,114 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 278 selfloop transitions, 468 changer transitions 286/1037 dead transitions. [2024-06-28 01:15:33,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 1037 transitions, 33396 flow [2024-06-28 01:15:33,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2024-06-28 01:15:33,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2024-06-28 01:15:33,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 1489 transitions. [2024-06-28 01:15:33,117 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.558095952023988 [2024-06-28 01:15:33,117 INFO L175 Difference]: Start difference. First operand has 350 places, 388 transitions, 8360 flow. Second operand 92 states and 1489 transitions. [2024-06-28 01:15:33,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 1037 transitions, 33396 flow [2024-06-28 01:15:39,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 1037 transitions, 27648 flow, removed 2782 selfloop flow, removed 41 redundant places. [2024-06-28 01:15:39,751 INFO L231 Difference]: Finished difference. Result has 437 places, 509 transitions, 12334 flow [2024-06-28 01:15:39,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=6064, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=388, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=348, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=92, PETRI_FLOW=12334, PETRI_PLACES=437, PETRI_TRANSITIONS=509} [2024-06-28 01:15:39,753 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 406 predicate places. [2024-06-28 01:15:39,753 INFO L495 AbstractCegarLoop]: Abstraction has has 437 places, 509 transitions, 12334 flow [2024-06-28 01:15:39,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 11.214285714285714) internal successors, (471), 42 states have internal predecessors, (471), 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:39,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:15:39,753 INFO L208 CegarLoopForPetriNet]: trace histogram [13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:15:39,765 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:39,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:39,957 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:39,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:15:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1889308217, now seen corresponding path program 7 times [2024-06-28 01:15:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:15:39,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914077023] [2024-06-28 01:15:39,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:15:39,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:15:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:40,494 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:15:40,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:15:40,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914077023] [2024-06-28 01:15:40,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914077023] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:15:40,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599021971] [2024-06-28 01:15:40,494 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-06-28 01:15:40,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:15:40,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:15:40,513 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:40,514 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:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:15:40,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 32 conjunts are in the unsatisfiable core [2024-06-28 01:15:40,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:15:40,680 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:15:40,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:15:41,316 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:15:41,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599021971] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:15:41,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:15:41,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 58 [2024-06-28 01:15:41,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541586431] [2024-06-28 01:15:41,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:15:41,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-06-28 01:15:41,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:15:41,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-06-28 01:15:41,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=2640, Unknown=0, NotChecked=0, Total=3422 [2024-06-28 01:15:41,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:15:41,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 509 transitions, 12334 flow. Second operand has 59 states, 59 states have (on average 11.05084745762712) internal successors, (652), 59 states have internal predecessors, (652), 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:41,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:15:41,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:15:41,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:15:50,082 INFO L124 PetriNetUnfolderBase]: 7354/14400 cut-off events. [2024-06-28 01:15:50,083 INFO L125 PetriNetUnfolderBase]: For 6807304/6807304 co-relation queries the response was YES. [2024-06-28 01:15:50,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221462 conditions, 14400 events. 7354/14400 cut-off events. For 6807304/6807304 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 93095 event pairs, 52 based on Foata normal form. 153/14540 useless extension candidates. Maximal degree in co-relation 221274. Up to 3403 conditions per place. [2024-06-28 01:15:50,495 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 332 selfloop transitions, 576 changer transitions 269/1182 dead transitions. [2024-06-28 01:15:50,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 513 places, 1182 transitions, 46585 flow [2024-06-28 01:15:50,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2024-06-28 01:15:50,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2024-06-28 01:15:50,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1605 transitions. [2024-06-28 01:15:50,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590386624869383 [2024-06-28 01:15:50,502 INFO L175 Difference]: Start difference. First operand has 437 places, 509 transitions, 12334 flow. Second operand 99 states and 1605 transitions. [2024-06-28 01:15:50,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 513 places, 1182 transitions, 46585 flow [2024-06-28 01:16:11,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 464 places, 1182 transitions, 35168 flow, removed 5539 selfloop flow, removed 49 redundant places. [2024-06-28 01:16:11,773 INFO L231 Difference]: Finished difference. Result has 511 places, 621 transitions, 15383 flow [2024-06-28 01:16:11,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=8311, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=465, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=15383, PETRI_PLACES=511, PETRI_TRANSITIONS=621} [2024-06-28 01:16:11,774 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 480 predicate places. [2024-06-28 01:16:11,774 INFO L495 AbstractCegarLoop]: Abstraction has has 511 places, 621 transitions, 15383 flow [2024-06-28 01:16:11,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 11.05084745762712) internal successors, (652), 59 states have internal predecessors, (652), 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:16:11,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:11,775 INFO L208 CegarLoopForPetriNet]: trace histogram [19, 19, 18, 18, 18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:16:11,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-06-28 01:16:11,986 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,SelfDestructingSolverStorable15 [2024-06-28 01:16:11,986 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:16:11,987 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:11,987 INFO L85 PathProgramCache]: Analyzing trace with hash 965033940, now seen corresponding path program 8 times [2024-06-28 01:16:11,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:16:11,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477528308] [2024-06-28 01:16:11,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:16:11,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:16:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:16:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:16:12,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:16:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477528308] [2024-06-28 01:16:12,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477528308] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:16:12,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066215983] [2024-06-28 01:16:12,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-28 01:16:12,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:16:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:16:12,758 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:16:12,759 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:16:12,842 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-28 01:16:12,843 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:12,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 44 conjunts are in the unsatisfiable core [2024-06-28 01:16:12,847 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:16:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:16:12,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 937 backedges. 0 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:16:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066215983] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:13,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:16:13,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2024-06-28 01:16:13,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332197421] [2024-06-28 01:16:13,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:13,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2024-06-28 01:16:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:16:13,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2024-06-28 01:16:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1508, Invalid=5134, Unknown=0, NotChecked=0, Total=6642 [2024-06-28 01:16:14,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 29 [2024-06-28 01:16:14,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 621 transitions, 15383 flow. Second operand has 82 states, 82 states have (on average 9.036585365853659) internal successors, (741), 82 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:16:14,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:14,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 29 [2024-06-28 01:16:14,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:24,219 INFO L124 PetriNetUnfolderBase]: 7948/15568 cut-off events. [2024-06-28 01:16:24,219 INFO L125 PetriNetUnfolderBase]: For 8813891/8813891 co-relation queries the response was YES. [2024-06-28 01:16:24,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245011 conditions, 15568 events. 7948/15568 cut-off events. For 8813891/8813891 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 101197 event pairs, 52 based on Foata normal form. 108/15669 useless extension candidates. Maximal degree in co-relation 244798. Up to 3685 conditions per place. [2024-06-28 01:16:24,551 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 349 selfloop transitions, 640 changer transitions 223/1217 dead transitions. [2024-06-28 01:16:24,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 587 places, 1217 transitions, 43775 flow [2024-06-28 01:16:24,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-06-28 01:16:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2024-06-28 01:16:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 1327 transitions. [2024-06-28 01:16:24,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4867938371239912 [2024-06-28 01:16:24,570 INFO L175 Difference]: Start difference. First operand has 511 places, 621 transitions, 15383 flow. Second operand 94 states and 1327 transitions. [2024-06-28 01:16:24,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 587 places, 1217 transitions, 43775 flow [2024-06-28 01:16:47,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 1217 transitions, 33666 flow, removed 4937 selfloop flow, removed 37 redundant places. [2024-06-28 01:16:47,586 INFO L231 Difference]: Finished difference. Result has 567 places, 685 transitions, 14750 flow [2024-06-28 01:16:47,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=10918, PETRI_DIFFERENCE_MINUEND_PLACES=457, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=577, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=94, PETRI_FLOW=14750, PETRI_PLACES=567, PETRI_TRANSITIONS=685} [2024-06-28 01:16:47,587 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 536 predicate places. [2024-06-28 01:16:47,587 INFO L495 AbstractCegarLoop]: Abstraction has has 567 places, 685 transitions, 14750 flow [2024-06-28 01:16:47,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 82 states have (on average 9.036585365853659) internal successors, (741), 82 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-28 01:16:47,587 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:16:47,587 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 19, 19, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:16:47,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-06-28 01:16:47,799 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,SelfDestructingSolverStorable16 [2024-06-28 01:16:47,799 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:16:47,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:16:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1436645882, now seen corresponding path program 9 times [2024-06-28 01:16:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:16:47,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629767438] [2024-06-28 01:16:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:16:47,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:16:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-28 01:16:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 1046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:16:48,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-28 01:16:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629767438] [2024-06-28 01:16:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629767438] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-28 01:16:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211194499] [2024-06-28 01:16:48,620 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-28 01:16:48,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-28 01:16:48,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-28 01:16:48,621 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-28 01:16:48,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-06-28 01:16:48,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2024-06-28 01:16:48,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-28 01:16:48,722 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 46 conjunts are in the unsatisfiable core [2024-06-28 01:16:48,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-28 01:16:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 1046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:16:48,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-28 01:16:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1046 backedges. 0 proven. 1046 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-28 01:16:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211194499] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-28 01:16:49,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-28 01:16:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 45 [2024-06-28 01:16:49,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468192117] [2024-06-28 01:16:49,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-28 01:16:49,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-06-28 01:16:49,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-28 01:16:49,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-06-28 01:16:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2024-06-28 01:16:49,631 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 29 [2024-06-28 01:16:49,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 685 transitions, 14750 flow. Second operand has 46 states, 46 states have (on average 10.956521739130435) internal successors, (504), 46 states have internal predecessors, (504), 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:16:49,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-28 01:16:49,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 29 [2024-06-28 01:16:49,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-28 01:16:58,415 INFO L124 PetriNetUnfolderBase]: 7858/15459 cut-off events. [2024-06-28 01:16:58,416 INFO L125 PetriNetUnfolderBase]: For 7303601/7303601 co-relation queries the response was YES. [2024-06-28 01:16:58,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216140 conditions, 15459 events. 7858/15459 cut-off events. For 7303601/7303601 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 101018 event pairs, 76 based on Foata normal form. 18/15470 useless extension candidates. Maximal degree in co-relation 215928. Up to 3625 conditions per place. [2024-06-28 01:16:58,743 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 334 selfloop transitions, 634 changer transitions 171/1144 dead transitions. [2024-06-28 01:16:58,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 1144 transitions, 32517 flow [2024-06-28 01:16:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2024-06-28 01:16:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2024-06-28 01:16:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 1351 transitions. [2024-06-28 01:16:58,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5545977011494253 [2024-06-28 01:16:58,746 INFO L175 Difference]: Start difference. First operand has 567 places, 685 transitions, 14750 flow. Second operand 84 states and 1351 transitions. [2024-06-28 01:16:58,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 1144 transitions, 32517 flow [2024-06-28 01:17:25,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 591 places, 1144 transitions, 29668 flow, removed 1140 selfloop flow, removed 52 redundant places. [2024-06-28 01:17:25,286 INFO L231 Difference]: Finished difference. Result has 595 places, 689 transitions, 14129 flow [2024-06-28 01:17:25,286 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=12447, PETRI_DIFFERENCE_MINUEND_PLACES=508, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=630, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=14129, PETRI_PLACES=595, PETRI_TRANSITIONS=689} [2024-06-28 01:17:25,287 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 564 predicate places. [2024-06-28 01:17:25,287 INFO L495 AbstractCegarLoop]: Abstraction has has 595 places, 689 transitions, 14129 flow [2024-06-28 01:17:25,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 10.956521739130435) internal successors, (504), 46 states have internal predecessors, (504), 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:17:25,288 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-28 01:17:25,293 INFO L208 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:17:25,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-06-28 01:17:25,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-06-28 01:17:25,493 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-06-28 01:17:25,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-28 01:17:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -1639112042, now seen corresponding path program 10 times [2024-06-28 01:17:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-28 01:17:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285943476] [2024-06-28 01:17:25,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-28 01:17:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-28 01:17:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:17:25,510 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-28 01:17:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-28 01:17:25,567 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-28 01:17:25,567 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-28 01:17:25,568 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-06-28 01:17:25,569 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-06-28 01:17:25,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-06-28 01:17:25,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-06-28 01:17:25,570 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-06-28 01:17:25,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-06-28 01:17:25,570 INFO L445 BasicCegarLoop]: Path program histogram: [10, 2, 1, 1, 1, 1, 1, 1, 1] [2024-06-28 01:17:25,574 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-28 01:17:25,574 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-28 01:17:25,678 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-28 01:17:25,678 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-28 01:17:25,679 INFO L201 PluginConnector]: Adding new model witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.06 01:17:25 BasicIcfg [2024-06-28 01:17:25,679 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-28 01:17:25,681 INFO L158 Benchmark]: Toolchain (without parser) took 145598.62ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 83.6MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-06-28 01:17:25,681 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:17:25,681 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-28 01:17:25,681 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.48ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 120.9MB in the end (delta: -37.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-06-28 01:17:25,682 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.27ms. Allocated memory is still 159.4MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:17:25,682 INFO L158 Benchmark]: Boogie Preprocessor took 58.19ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-28 01:17:25,682 INFO L158 Benchmark]: RCFGBuilder took 368.50ms. Allocated memory is still 159.4MB. Free memory was 116.7MB in the beginning and 96.5MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-06-28 01:17:25,682 INFO L158 Benchmark]: TraceAbstraction took 144478.02ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 95.7MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2024-06-28 01:17:25,683 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 121.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * Witness Parser took 0.15ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.48ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 120.9MB in the end (delta: -37.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.27ms. Allocated memory is still 159.4MB. Free memory was 120.9MB in the beginning and 118.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.19ms. Allocated memory is still 159.4MB. Free memory was 118.8MB in the beginning and 116.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 368.50ms. Allocated memory is still 159.4MB. Free memory was 116.7MB in the beginning and 96.5MB in the end (delta: 20.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 144478.02ms. Allocated memory was 159.4MB in the beginning and 7.6GB in the end (delta: 7.4GB). Free memory was 95.7MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 722]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1] 0 //@ ghost int multithreaded = 0; [L694] 0 int i = 3, j = 6; [L712] 0 pthread_t id1, id2; [L713] 0 //@ ghost multithreaded = 1; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L713] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1=-1, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] 0 //@ assert (((!multithreaded || ((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=3, id1=-1, id2=0, j=6, k=0] [L704] 2 int k = 0; VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=0] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=1] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=6, k=0, k=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 < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=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] [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] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=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] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=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] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=18, k=6, k=6] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=6] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=18, k=6, k=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] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L696] COND TRUE 1 k < 20 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] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=8, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=10, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=9] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=10, k=10] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=10] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=26, k=10, k=11] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=10, k=11] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=27, j=28, k=11, k=11] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=11] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=28, k=11, k=12] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=11, k=12] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=29, j=30, k=12, k=12] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=12] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=30, k=12, k=13] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=12, k=13] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=31, j=32, k=13, k=13] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=13] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=32, k=13, k=14] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=13, k=14] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=33, j=34, k=14, k=14] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=14] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=34, k=14, k=15] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=14, k=15] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=35, j=36, k=15, k=15] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=15] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=36, k=15, k=16] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=15, k=16] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=37, j=38, k=16, k=16] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=16] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=38, k=16, k=17] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=16, k=17] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=39, j=40, k=17, k=17] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=17] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=40, k=17, k=18] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=17, k=18] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=41, j=42, k=18, k=18] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=18] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=42, k=18, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=18, k=19] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L704] COND TRUE 2 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L715] 0 //@ assert (((!multithreaded || ((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=43, id1=-1, id2=0, j=44, k=19, k=19] [L716] 0 int condI = i >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=43, id1=-1, id2=0, j=44, k=19, k=19] [L696] COND TRUE 1 k < 20 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=43, j=44, k=19, k=19] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=44, k=19, k=19] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=45, j=46, k=19, k=19] [L719] 0 int condJ = j >= (2*20 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=45, id1=-1, id2=0, j=46, k=19, k=19] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 144.3s, OverallIterations: 19, TraceHistogramMax: 20, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 130.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12060 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11929 mSDsluCounter, 564 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 548 mSDsCounter, 622 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13632 IncrementalHoareTripleChecker+Invalid, 14254 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 622 mSolverCounterUnsat, 16 mSDtfsCounter, 13632 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2172 GetRequests, 1118 SyntacticMatches, 38 SemanticMatches, 1016 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36331 ImplicationChecksByTransitivity, 14.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15383occurred in iteration=16, InterpolantAutomatonStates: 707, 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, 9.8s InterpolantComputationTime, 1554 NumberOfCodeBlocks, 1554 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 2044 ConstructedInterpolants, 0 QuantifiedInterpolants, 7909 SizeOfPredicates, 185 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 38 InterpolantComputations, 8 PerfectInterpolantSequences, 27/9339 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:17:25,711 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