./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-05-07_14-17-48.files/mutex-meet/triangular-longer-2.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b44c8288 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/pthread/triangular-longer-2.i ./goblint.2024-05-07_14-17-48.files/mutex-meet/triangular-longer-2.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-wip.fs.witness-ghost-b44c828-m [2024-05-12 11:10:44,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-12 11:10:44,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-05-12 11:10:44,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-12 11:10:44,352 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-12 11:10:44,388 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-12 11:10:44,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-12 11:10:44,390 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-12 11:10:44,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-05-12 11:10:44,394 INFO L153 SettingsManager]: * Use memory slicer=true [2024-05-12 11:10:44,395 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-12 11:10:44,395 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-12 11:10:44,395 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-12 11:10:44,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-12 11:10:44,397 INFO L153 SettingsManager]: * Use SBE=true [2024-05-12 11:10:44,397 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-12 11:10:44,397 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-12 11:10:44,398 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-12 11:10:44,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-12 11:10:44,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-12 11:10:44,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-12 11:10:44,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-12 11:10:44,399 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-12 11:10:44,399 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-12 11:10:44,400 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-05-12 11:10:44,400 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-12 11:10:44,400 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-12 11:10:44,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-12 11:10:44,401 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-12 11:10:44,401 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-12 11:10:44,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-05-12 11:10:44,403 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-12 11:10:44,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:10:44,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-12 11:10:44,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-12 11:10:44,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-05-12 11:10:44,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-12 11:10:44,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-12 11:10:44,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-12 11:10:44,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-05-12 11:10:44,405 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-12 11:10:44,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-05-12 11:10:44,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-05-12 11:10:44,405 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-05-12 11:10:44,658 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-12 11:10:44,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-12 11:10:44,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-12 11:10:44,687 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-05-12 11:10:44,687 INFO L274 PluginConnector]: Witness Parser initialized [2024-05-12 11:10:44,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-07_14-17-48.files/mutex-meet/triangular-longer-2.yml/witness.yml [2024-05-12 11:10:44,796 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-12 11:10:44,797 INFO L274 PluginConnector]: CDTParser initialized [2024-05-12 11:10:44,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-05-12 11:10:45,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-12 11:10:46,211 INFO L384 CDTParser]: Found 1 translation units. [2024-05-12 11:10:46,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i [2024-05-12 11:10:46,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb37c7a16/14214a2f66484a56a0cb9e0092e353d5/FLAGb9ab0ece2 [2024-05-12 11:10:46,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb37c7a16/14214a2f66484a56a0cb9e0092e353d5 [2024-05-12 11:10:46,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-12 11:10:46,251 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-12 11:10:46,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-12 11:10:46,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-12 11:10:46,258 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-12 11:10:46,259 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:44" (1/2) ... [2024-05-12 11:10:46,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b18bd2 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:46, skipping insertion in model container [2024-05-12 11:10:46,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:44" (1/2) ... [2024-05-12 11:10:46,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7cb2b597 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 12.05 11:10:46, skipping insertion in model container [2024-05-12 11:10:46,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:10:46" (2/2) ... [2024-05-12 11:10:46,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58b18bd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46, skipping insertion in model container [2024-05-12 11:10:46,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.05 11:10:46" (2/2) ... [2024-05-12 11:10:46,263 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-05-12 11:10:46,296 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-05-12 11:10:46,297 INFO L97 edCorrectnessWitness]: Location invariant before [L715-L715] (((! multithreaded || ((((0 <= j && 4 <= j) && j % 2 == 0) && j != 0) && j != 1)) && (! multithreaded || ((-7LL + (long long )i) + (long long )j >= 0LL && (1LL - (long long )i) + (long long )j >= 0LL))) && (! multithreaded || ((((((((0 <= i && 0 <= j) && 3 <= i) && 4 <= j) && i % 2 == 1) && j % 2 == 0) && i != 0) && j != 0) && j != 1))) && (! multithreaded || (((0 <= i && 3 <= i) && i % 2 == 1) && i != 0)) [2024-05-12 11:10:46,298 INFO L97 edCorrectnessWitness]: Location invariant before [L714-L714] (((! multithreaded || ((((0 <= j && 4 <= j) && j % 2 == 0) && j != 0) && j != 1)) && (! multithreaded || ((-7LL + (long long )i) + (long long )j >= 0LL && (1LL - (long long )i) + (long long )j >= 0LL))) && (! multithreaded || ((((((((0 <= i && 0 <= j) && 3 <= i) && 4 <= j) && i % 2 == 1) && j % 2 == 0) && i != 0) && j != 0) && j != 1))) && (! multithreaded || (((0 <= i && 3 <= i) && i % 2 == 1) && i != 0)) [2024-05-12 11:10:46,298 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-05-12 11:10:46,298 INFO L106 edCorrectnessWitness]: ghost_update [L713-L713] multithreaded = 1; [2024-05-12 11:10:46,335 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-12 11:10:46,662 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-05-12 11:10:46,666 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:10:46,673 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-05-12 11:10:46,800 WARN L246 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longer-2.i[30963,30976] [2024-05-12 11:10:46,805 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-05-12 11:10:46,843 INFO L206 MainTranslator]: Completed translation [2024-05-12 11:10:46,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46 WrapperNode [2024-05-12 11:10:46,844 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-12 11:10:46,845 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-12 11:10:46,845 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-12 11:10:46,845 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-12 11:10:46,851 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,880 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,918 INFO L138 Inliner]: procedures = 169, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2024-05-12 11:10:46,919 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-12 11:10:46,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-12 11:10:46,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-12 11:10:46,920 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-12 11:10:46,938 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,944 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,964 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 1, 1]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-05-12 11:10:46,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,974 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,979 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,982 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-12 11:10:46,982 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-12 11:10:46,982 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-12 11:10:46,983 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-12 11:10:46,983 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (1/1) ... [2024-05-12 11:10:46,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-05-12 11:10:47,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:47,015 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-05-12 11:10:47,016 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-05-12 11:10:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-05-12 11:10:47,046 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-05-12 11:10:47,046 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-05-12 11:10:47,047 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-12 11:10:47,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-05-12 11:10:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-05-12 11:10:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-05-12 11:10:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-12 11:10:47,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-12 11:10:47,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-12 11:10:47,050 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-12 11:10:47,177 INFO L244 CfgBuilder]: Building ICFG [2024-05-12 11:10:47,179 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-12 11:10:47,355 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-05-12 11:10:47,355 INFO L293 CfgBuilder]: Performing block encoding [2024-05-12 11:10:47,471 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-12 11:10:47,472 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-05-12 11:10:47,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:10:47 BoogieIcfgContainer [2024-05-12 11:10:47,474 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-12 11:10:47,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-12 11:10:47,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-12 11:10:47,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-12 11:10:47,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 12.05 11:10:44" (1/4) ... [2024-05-12 11:10:47,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7350c209 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 12.05 11:10:47, skipping insertion in model container [2024-05-12 11:10:47,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.05 11:10:46" (2/4) ... [2024-05-12 11:10:47,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7350c209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:10:47, skipping insertion in model container [2024-05-12 11:10:47,482 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.05 11:10:46" (3/4) ... [2024-05-12 11:10:47,483 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7350c209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.05 11:10:47, skipping insertion in model container [2024-05-12 11:10:47,483 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.05 11:10:47" (4/4) ... [2024-05-12 11:10:47,484 INFO L112 eAbstractionObserver]: Analyzing ICFG triangular-longer-2.i [2024-05-12 11:10:47,501 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-12 11:10:47,502 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-05-12 11:10:47,502 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-12 11:10:47,544 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-05-12 11:10:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 30 transitions, 68 flow [2024-05-12 11:10:47,602 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2024-05-12 11:10:47,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:10:47,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 28 events. 3/28 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/22 useless extension candidates. Maximal degree in co-relation 26. Up to 2 conditions per place. [2024-05-12 11:10:47,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 30 transitions, 68 flow [2024-05-12 11:10:47,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 62 flow [2024-05-12 11:10:47,638 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-05-12 11:10:47,644 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;@41c1e30d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-12 11:10:47,644 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-05-12 11:10:47,648 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-05-12 11:10:47,648 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-05-12 11:10:47,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-05-12 11:10:47,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:47,649 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-05-12 11:10:47,649 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-05-12 11:10:47,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1410544718, now seen corresponding path program 1 times [2024-05-12 11:10:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608221442] [2024-05-12 11:10:47,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:48,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:48,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608221442] [2024-05-12 11:10:48,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608221442] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:48,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:48,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-05-12 11:10:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565840438] [2024-05-12 11:10:48,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:48,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-12 11:10:48,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:48,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-12 11:10:48,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-12 11:10:48,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:48,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-05-12 11:10:48,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:48,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:48,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:48,599 INFO L124 PetriNetUnfolderBase]: 172/327 cut-off events. [2024-05-12 11:10:48,600 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-05-12 11:10:48,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 327 events. 172/327 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1306 event pairs, 54 based on Foata normal form. 20/327 useless extension candidates. Maximal degree in co-relation 614. Up to 211 conditions per place. [2024-05-12 11:10:48,603 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 25 selfloop transitions, 3 changer transitions 2/38 dead transitions. [2024-05-12 11:10:48,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 145 flow [2024-05-12 11:10:48,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-12 11:10:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-05-12 11:10:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2024-05-12 11:10:48,615 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7111111111111111 [2024-05-12 11:10:48,617 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 62 flow. Second operand 3 states and 64 transitions. [2024-05-12 11:10:48,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 145 flow [2024-05-12 11:10:48,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:48,622 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 77 flow [2024-05-12 11:10:48,624 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2024-05-12 11:10:48,627 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 1 predicate places. [2024-05-12 11:10:48,627 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 77 flow [2024-05-12 11:10:48,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-05-12 11:10:48,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:48,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:48,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-12 11:10:48,629 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-05-12 11:10:48,630 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:48,630 INFO L85 PathProgramCache]: Analyzing trace with hash -421416505, now seen corresponding path program 1 times [2024-05-12 11:10:48,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:48,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111076380] [2024-05-12 11:10:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:48,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:49,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:49,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111076380] [2024-05-12 11:10:49,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111076380] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:49,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:49,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-12 11:10:49,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427725883] [2024-05-12 11:10:49,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:49,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-05-12 11:10:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:49,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-05-12 11:10:49,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-05-12 11:10:49,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:49,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-05-12 11:10:49,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:49,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:49,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:49,232 INFO L124 PetriNetUnfolderBase]: 160/318 cut-off events. [2024-05-12 11:10:49,233 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-05-12 11:10:49,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 318 events. 160/318 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1260 event pairs, 37 based on Foata normal form. 21/335 useless extension candidates. Maximal degree in co-relation 683. Up to 103 conditions per place. [2024-05-12 11:10:49,240 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 36 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-05-12 11:10:49,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 48 transitions, 205 flow [2024-05-12 11:10:49,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-12 11:10:49,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-05-12 11:10:49,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 93 transitions. [2024-05-12 11:10:49,249 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.62 [2024-05-12 11:10:49,249 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 77 flow. Second operand 5 states and 93 transitions. [2024-05-12 11:10:49,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 48 transitions, 205 flow [2024-05-12 11:10:49,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 48 transitions, 202 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-05-12 11:10:49,257 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 91 flow [2024-05-12 11:10:49,257 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, 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=91, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2024-05-12 11:10:49,261 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2024-05-12 11:10:49,261 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 91 flow [2024-05-12 11:10:49,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 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-05-12 11:10:49,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:49,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:49,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-12 11:10:49,270 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-05-12 11:10:49,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:49,271 INFO L85 PathProgramCache]: Analyzing trace with hash 280436029, now seen corresponding path program 1 times [2024-05-12 11:10:49,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:49,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624237374] [2024-05-12 11:10:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:49,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:49,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:49,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:49,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624237374] [2024-05-12 11:10:49,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624237374] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:49,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:49,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:10:49,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078111066] [2024-05-12 11:10:49,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:49,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:10:49,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:49,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:10:49,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:10:49,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-05-12 11:10:49,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 11:10:49,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:49,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-05-12 11:10:49,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:49,638 INFO L124 PetriNetUnfolderBase]: 262/519 cut-off events. [2024-05-12 11:10:49,638 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2024-05-12 11:10:49,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 519 events. 262/519 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2395 event pairs, 94 based on Foata normal form. 9/515 useless extension candidates. Maximal degree in co-relation 1148. Up to 283 conditions per place. [2024-05-12 11:10:49,642 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 28 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2024-05-12 11:10:49,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 39 transitions, 185 flow [2024-05-12 11:10:49,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-05-12 11:10:49,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-05-12 11:10:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 66 transitions. [2024-05-12 11:10:49,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-05-12 11:10:49,644 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 91 flow. Second operand 4 states and 66 transitions. [2024-05-12 11:10:49,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 39 transitions, 185 flow [2024-05-12 11:10:49,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 39 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:49,646 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 105 flow [2024-05-12 11:10:49,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=105, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2024-05-12 11:10:49,647 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 6 predicate places. [2024-05-12 11:10:49,647 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 105 flow [2024-05-12 11:10:49,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-05-12 11:10:49,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:49,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:49,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-12 11:10:49,648 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-05-12 11:10:49,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:49,649 INFO L85 PathProgramCache]: Analyzing trace with hash 77939701, now seen corresponding path program 1 times [2024-05-12 11:10:49,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:49,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637672317] [2024-05-12 11:10:49,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:49,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:49,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:49,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:49,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:49,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637672317] [2024-05-12 11:10:49,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637672317] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:49,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:49,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-05-12 11:10:49,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867554167] [2024-05-12 11:10:49,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:49,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:10:49,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:49,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:10:49,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:10:49,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:49,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 105 flow. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-05-12 11:10:49,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:49,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:49,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:49,936 INFO L124 PetriNetUnfolderBase]: 544/949 cut-off events. [2024-05-12 11:10:49,936 INFO L125 PetriNetUnfolderBase]: For 654/663 co-relation queries the response was YES. [2024-05-12 11:10:49,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2295 conditions, 949 events. 544/949 cut-off events. For 654/663 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4353 event pairs, 138 based on Foata normal form. 0/909 useless extension candidates. Maximal degree in co-relation 2275. Up to 416 conditions per place. [2024-05-12 11:10:49,941 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 31 selfloop transitions, 6 changer transitions 23/65 dead transitions. [2024-05-12 11:10:49,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 65 transitions, 352 flow [2024-05-12 11:10:49,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:10:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:10:49,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 102 transitions. [2024-05-12 11:10:49,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2024-05-12 11:10:49,947 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 105 flow. Second operand 6 states and 102 transitions. [2024-05-12 11:10:49,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 65 transitions, 352 flow [2024-05-12 11:10:49,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:49,952 INFO L231 Difference]: Finished difference. Result has 45 places, 31 transitions, 139 flow [2024-05-12 11:10:49,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=45, PETRI_TRANSITIONS=31} [2024-05-12 11:10:49,953 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-05-12 11:10:49,953 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 31 transitions, 139 flow [2024-05-12 11:10:49,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 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-05-12 11:10:49,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:49,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:49,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-12 11:10:49,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:49,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash -875210308, now seen corresponding path program 1 times [2024-05-12 11:10:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:49,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183093625] [2024-05-12 11:10:49,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:49,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183093625] [2024-05-12 11:10:50,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183093625] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-12 11:10:50,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512645744] [2024-05-12 11:10:50,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-12 11:10:50,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-12 11:10:50,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-12 11:10:50,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 30 [2024-05-12 11:10:50,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 31 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-05-12 11:10:50,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 30 [2024-05-12 11:10:50,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:50,398 INFO L124 PetriNetUnfolderBase]: 283/573 cut-off events. [2024-05-12 11:10:50,399 INFO L125 PetriNetUnfolderBase]: For 668/679 co-relation queries the response was YES. [2024-05-12 11:10:50,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1454 conditions, 573 events. 283/573 cut-off events. For 668/679 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2448 event pairs, 64 based on Foata normal form. 21/593 useless extension candidates. Maximal degree in co-relation 1430. Up to 238 conditions per place. [2024-05-12 11:10:50,403 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 42 selfloop transitions, 7 changer transitions 1/58 dead transitions. [2024-05-12 11:10:50,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 58 transitions, 315 flow [2024-05-12 11:10:50,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-12 11:10:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-05-12 11:10:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2024-05-12 11:10:50,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6055555555555555 [2024-05-12 11:10:50,409 INFO L175 Difference]: Start difference. First operand has 45 places, 31 transitions, 139 flow. Second operand 6 states and 109 transitions. [2024-05-12 11:10:50,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 58 transitions, 315 flow [2024-05-12 11:10:50,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 306 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-05-12 11:10:50,415 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 168 flow [2024-05-12 11:10:50,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=168, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2024-05-12 11:10:50,418 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 14 predicate places. [2024-05-12 11:10:50,418 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 168 flow [2024-05-12 11:10:50,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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-05-12 11:10:50,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:50,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:50,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-05-12 11:10:50,419 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-05-12 11:10:50,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1063645019, now seen corresponding path program 1 times [2024-05-12 11:10:50,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:50,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273517410] [2024-05-12 11:10:50,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:50,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273517410] [2024-05-12 11:10:50,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273517410] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:10:50,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426047357] [2024-05-12 11:10:50,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:10:50,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:10:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:10:50,552 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:50,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:50,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:50,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:50,760 INFO L124 PetriNetUnfolderBase]: 652/1185 cut-off events. [2024-05-12 11:10:50,760 INFO L125 PetriNetUnfolderBase]: For 1882/1898 co-relation queries the response was YES. [2024-05-12 11:10:50,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 1185 events. 652/1185 cut-off events. For 1882/1898 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5720 event pairs, 208 based on Foata normal form. 36/1212 useless extension candidates. Maximal degree in co-relation 3254. Up to 649 conditions per place. [2024-05-12 11:10:50,769 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 52 selfloop transitions, 11 changer transitions 21/89 dead transitions. [2024-05-12 11:10:50,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 89 transitions, 562 flow [2024-05-12 11:10:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:10:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:10:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 148 transitions. [2024-05-12 11:10:50,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5481481481481482 [2024-05-12 11:10:50,771 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 168 flow. Second operand 9 states and 148 transitions. [2024-05-12 11:10:50,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 89 transitions, 562 flow [2024-05-12 11:10:50,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 89 transitions, 542 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-05-12 11:10:50,776 INFO L231 Difference]: Finished difference. Result has 59 places, 40 transitions, 267 flow [2024-05-12 11:10:50,776 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=267, PETRI_PLACES=59, PETRI_TRANSITIONS=40} [2024-05-12 11:10:50,776 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 27 predicate places. [2024-05-12 11:10:50,777 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 40 transitions, 267 flow [2024-05-12 11:10:50,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:50,777 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:50,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:50,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-05-12 11:10:50,778 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-05-12 11:10:50,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:50,778 INFO L85 PathProgramCache]: Analyzing trace with hash 2039593339, now seen corresponding path program 2 times [2024-05-12 11:10:50,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:50,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067363214] [2024-05-12 11:10:50,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:50,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:50,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:50,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:50,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067363214] [2024-05-12 11:10:50,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067363214] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:50,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:50,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-12 11:10:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8268465] [2024-05-12 11:10:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:50,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-12 11:10:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:50,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-12 11:10:50,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-05-12 11:10:50,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:50,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 40 transitions, 267 flow. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:50,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:50,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:50,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:51,154 INFO L124 PetriNetUnfolderBase]: 564/1046 cut-off events. [2024-05-12 11:10:51,155 INFO L125 PetriNetUnfolderBase]: For 2820/2844 co-relation queries the response was YES. [2024-05-12 11:10:51,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3301 conditions, 1046 events. 564/1046 cut-off events. For 2820/2844 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4942 event pairs, 176 based on Foata normal form. 54/1090 useless extension candidates. Maximal degree in co-relation 3269. Up to 518 conditions per place. [2024-05-12 11:10:51,162 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 45 selfloop transitions, 15 changer transitions 32/97 dead transitions. [2024-05-12 11:10:51,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 97 transitions, 723 flow [2024-05-12 11:10:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-12 11:10:51,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-05-12 11:10:51,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 160 transitions. [2024-05-12 11:10:51,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-05-12 11:10:51,164 INFO L175 Difference]: Start difference. First operand has 59 places, 40 transitions, 267 flow. Second operand 10 states and 160 transitions. [2024-05-12 11:10:51,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 97 transitions, 723 flow [2024-05-12 11:10:51,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 97 transitions, 696 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-05-12 11:10:51,174 INFO L231 Difference]: Finished difference. Result has 68 places, 44 transitions, 345 flow [2024-05-12 11:10:51,174 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=345, PETRI_PLACES=68, PETRI_TRANSITIONS=44} [2024-05-12 11:10:51,175 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 36 predicate places. [2024-05-12 11:10:51,175 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 44 transitions, 345 flow [2024-05-12 11:10:51,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 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-05-12 11:10:51,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:51,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:51,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-05-12 11:10:51,176 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-05-12 11:10:51,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:51,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1855387724, now seen corresponding path program 1 times [2024-05-12 11:10:51,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:51,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917588856] [2024-05-12 11:10:51,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:51,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:51,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:51,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917588856] [2024-05-12 11:10:51,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917588856] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:51,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:51,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:10:51,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925901198] [2024-05-12 11:10:51,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:51,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:10:51,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:10:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:10:51,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:51,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 44 transitions, 345 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:51,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:51,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:51,597 INFO L124 PetriNetUnfolderBase]: 688/1257 cut-off events. [2024-05-12 11:10:51,597 INFO L125 PetriNetUnfolderBase]: For 4422/4438 co-relation queries the response was YES. [2024-05-12 11:10:51,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 1257 events. 688/1257 cut-off events. For 4422/4438 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6201 event pairs, 149 based on Foata normal form. 27/1271 useless extension candidates. Maximal degree in co-relation 4213. Up to 508 conditions per place. [2024-05-12 11:10:51,608 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 59 selfloop transitions, 21 changer transitions 23/108 dead transitions. [2024-05-12 11:10:51,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 849 flow [2024-05-12 11:10:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:10:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:10:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2024-05-12 11:10:51,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363636363636364 [2024-05-12 11:10:51,610 INFO L175 Difference]: Start difference. First operand has 68 places, 44 transitions, 345 flow. Second operand 11 states and 177 transitions. [2024-05-12 11:10:51,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 849 flow [2024-05-12 11:10:51,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 785 flow, removed 19 selfloop flow, removed 8 redundant places. [2024-05-12 11:10:51,625 INFO L231 Difference]: Finished difference. Result has 74 places, 50 transitions, 450 flow [2024-05-12 11:10:51,625 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=450, PETRI_PLACES=74, PETRI_TRANSITIONS=50} [2024-05-12 11:10:51,626 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 42 predicate places. [2024-05-12 11:10:51,626 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 50 transitions, 450 flow [2024-05-12 11:10:51,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:51,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:51,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-05-12 11:10:51,627 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-05-12 11:10:51,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:51,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1121422542, now seen corresponding path program 2 times [2024-05-12 11:10:51,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:51,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323259595] [2024-05-12 11:10:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:51,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:51,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323259595] [2024-05-12 11:10:51,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323259595] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-12 11:10:51,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-12 11:10:51,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-12 11:10:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584913620] [2024-05-12 11:10:51,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-12 11:10:51,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-12 11:10:51,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:51,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-12 11:10:51,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-05-12 11:10:51,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:51,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 50 transitions, 450 flow. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:51,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:51,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:51,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:52,039 INFO L124 PetriNetUnfolderBase]: 661/1213 cut-off events. [2024-05-12 11:10:52,039 INFO L125 PetriNetUnfolderBase]: For 7940/7957 co-relation queries the response was YES. [2024-05-12 11:10:52,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4825 conditions, 1213 events. 661/1213 cut-off events. For 7940/7957 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5900 event pairs, 126 based on Foata normal form. 45/1245 useless extension candidates. Maximal degree in co-relation 4785. Up to 425 conditions per place. [2024-05-12 11:10:52,049 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 48 selfloop transitions, 25 changer transitions 33/111 dead transitions. [2024-05-12 11:10:52,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 1044 flow [2024-05-12 11:10:52,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-12 11:10:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-05-12 11:10:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2024-05-12 11:10:52,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2024-05-12 11:10:52,052 INFO L175 Difference]: Start difference. First operand has 74 places, 50 transitions, 450 flow. Second operand 11 states and 174 transitions. [2024-05-12 11:10:52,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 1044 flow [2024-05-12 11:10:52,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 971 flow, removed 25 selfloop flow, removed 5 redundant places. [2024-05-12 11:10:52,076 INFO L231 Difference]: Finished difference. Result has 82 places, 53 transitions, 536 flow [2024-05-12 11:10:52,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=536, PETRI_PLACES=82, PETRI_TRANSITIONS=53} [2024-05-12 11:10:52,077 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 50 predicate places. [2024-05-12 11:10:52,077 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 53 transitions, 536 flow [2024-05-12 11:10:52,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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-05-12 11:10:52,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:52,078 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:52,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-05-12 11:10:52,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:10:52,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:52,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1026970189, now seen corresponding path program 1 times [2024-05-12 11:10:52,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:52,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473876747] [2024-05-12 11:10:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:52,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:52,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:52,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:52,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473876747] [2024-05-12 11:10:52,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473876747] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:52,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656876629] [2024-05-12 11:10:52,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:52,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:52,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:52,364 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-05-12 11:10:52,384 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-05-12 11:10:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:52,446 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2024-05-12 11:10:52,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:52,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:52,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:52,980 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:52,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656876629] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:52,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:52,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 19 [2024-05-12 11:10:52,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244169286] [2024-05-12 11:10:52,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:52,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-05-12 11:10:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-05-12 11:10:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-05-12 11:10:53,052 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 30 [2024-05-12 11:10:53,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 53 transitions, 536 flow. Second operand has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 21 states have internal predecessors, (240), 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-05-12 11:10:53,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:53,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 30 [2024-05-12 11:10:53,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:53,423 INFO L124 PetriNetUnfolderBase]: 676/1259 cut-off events. [2024-05-12 11:10:53,423 INFO L125 PetriNetUnfolderBase]: For 12792/12882 co-relation queries the response was YES. [2024-05-12 11:10:53,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5368 conditions, 1259 events. 676/1259 cut-off events. For 12792/12882 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 6140 event pairs, 107 based on Foata normal form. 26/1226 useless extension candidates. Maximal degree in co-relation 5324. Up to 462 conditions per place. [2024-05-12 11:10:53,434 INFO L140 encePairwiseOnDemand]: 25/30 looper letters, 54 selfloop transitions, 18 changer transitions 5/89 dead transitions. [2024-05-12 11:10:53,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 89 transitions, 840 flow [2024-05-12 11:10:53,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-12 11:10:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-05-12 11:10:53,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 142 transitions. [2024-05-12 11:10:53,436 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5259259259259259 [2024-05-12 11:10:53,436 INFO L175 Difference]: Start difference. First operand has 82 places, 53 transitions, 536 flow. Second operand 9 states and 142 transitions. [2024-05-12 11:10:53,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 89 transitions, 840 flow [2024-05-12 11:10:53,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 89 transitions, 760 flow, removed 19 selfloop flow, removed 11 redundant places. [2024-05-12 11:10:53,454 INFO L231 Difference]: Finished difference. Result has 76 places, 53 transitions, 512 flow [2024-05-12 11:10:53,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=512, PETRI_PLACES=76, PETRI_TRANSITIONS=53} [2024-05-12 11:10:53,455 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 44 predicate places. [2024-05-12 11:10:53,455 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 53 transitions, 512 flow [2024-05-12 11:10:53,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 11.428571428571429) internal successors, (240), 21 states have internal predecessors, (240), 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-05-12 11:10:53,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:53,456 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:53,476 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-05-12 11:10:53,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-12 11:10:53,676 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-05-12 11:10:53,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1405344510, now seen corresponding path program 1 times [2024-05-12 11:10:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:53,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231474532] [2024-05-12 11:10:53,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:53,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:53,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231474532] [2024-05-12 11:10:53,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231474532] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089251070] [2024-05-12 11:10:53,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:53,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:53,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:53,793 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-05-12 11:10:53,808 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-05-12 11:10:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:53,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 11:10:53,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:53,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:53,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:54,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:54,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089251070] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:54,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:54,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-05-12 11:10:54,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491352441] [2024-05-12 11:10:54,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:54,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:10:54,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:10:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:10:54,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:54,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 53 transitions, 512 flow. Second operand has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:54,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:54,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:54,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:54,563 INFO L124 PetriNetUnfolderBase]: 838/1548 cut-off events. [2024-05-12 11:10:54,563 INFO L125 PetriNetUnfolderBase]: For 13455/13455 co-relation queries the response was YES. [2024-05-12 11:10:54,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 1548 events. 838/1548 cut-off events. For 13455/13455 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 7440 event pairs, 289 based on Foata normal form. 63/1607 useless extension candidates. Maximal degree in co-relation 6542. Up to 871 conditions per place. [2024-05-12 11:10:54,576 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 71 selfloop transitions, 19 changer transitions 67/161 dead transitions. [2024-05-12 11:10:54,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 161 transitions, 1600 flow [2024-05-12 11:10:54,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-05-12 11:10:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-05-12 11:10:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 292 transitions. [2024-05-12 11:10:54,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.512280701754386 [2024-05-12 11:10:54,578 INFO L175 Difference]: Start difference. First operand has 76 places, 53 transitions, 512 flow. Second operand 19 states and 292 transitions. [2024-05-12 11:10:54,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 161 transitions, 1600 flow [2024-05-12 11:10:54,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 161 transitions, 1462 flow, removed 51 selfloop flow, removed 7 redundant places. [2024-05-12 11:10:54,595 INFO L231 Difference]: Finished difference. Result has 100 places, 59 transitions, 658 flow [2024-05-12 11:10:54,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=658, PETRI_PLACES=100, PETRI_TRANSITIONS=59} [2024-05-12 11:10:54,596 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 68 predicate places. [2024-05-12 11:10:54,596 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 59 transitions, 658 flow [2024-05-12 11:10:54,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:54,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:54,596 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:54,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-12 11:10:54,814 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,SelfDestructingSolverStorable10 [2024-05-12 11:10:54,815 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-05-12 11:10:54,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:54,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1756407554, now seen corresponding path program 2 times [2024-05-12 11:10:54,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:54,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311161446] [2024-05-12 11:10:54,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:54,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311161446] [2024-05-12 11:10:54,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311161446] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:54,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090326708] [2024-05-12 11:10:54,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 11:10:54,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:54,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:54,927 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-05-12 11:10:54,948 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-05-12 11:10:55,004 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 11:10:55,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:10:55,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2024-05-12 11:10:55,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:55,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:55,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:55,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090326708] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:55,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-05-12 11:10:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161191465] [2024-05-12 11:10:55,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:55,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-12 11:10:55,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:55,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-12 11:10:55,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-05-12 11:10:55,246 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:55,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 59 transitions, 658 flow. Second operand has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:55,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:55,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:55,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:55,906 INFO L124 PetriNetUnfolderBase]: 991/1823 cut-off events. [2024-05-12 11:10:55,907 INFO L125 PetriNetUnfolderBase]: For 30943/30943 co-relation queries the response was YES. [2024-05-12 11:10:55,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9544 conditions, 1823 events. 991/1823 cut-off events. For 30943/30943 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9090 event pairs, 92 based on Foata normal form. 81/1900 useless extension candidates. Maximal degree in co-relation 9493. Up to 415 conditions per place. [2024-05-12 11:10:55,925 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 91 selfloop transitions, 48 changer transitions 81/224 dead transitions. [2024-05-12 11:10:55,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 224 transitions, 2574 flow [2024-05-12 11:10:55,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-05-12 11:10:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-05-12 11:10:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 419 transitions. [2024-05-12 11:10:55,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5172839506172839 [2024-05-12 11:10:55,929 INFO L175 Difference]: Start difference. First operand has 100 places, 59 transitions, 658 flow. Second operand 27 states and 419 transitions. [2024-05-12 11:10:55,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 224 transitions, 2574 flow [2024-05-12 11:10:55,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 224 transitions, 2275 flow, removed 137 selfloop flow, removed 11 redundant places. [2024-05-12 11:10:55,971 INFO L231 Difference]: Finished difference. Result has 125 places, 74 transitions, 1021 flow [2024-05-12 11:10:55,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=1021, PETRI_PLACES=125, PETRI_TRANSITIONS=74} [2024-05-12 11:10:55,972 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 93 predicate places. [2024-05-12 11:10:55,972 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 74 transitions, 1021 flow [2024-05-12 11:10:55,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 10.538461538461538) internal successors, (137), 13 states have internal predecessors, (137), 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-05-12 11:10:55,973 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:55,973 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:55,991 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-05-12 11:10:56,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:56,189 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-05-12 11:10:56,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:56,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1898780841, now seen corresponding path program 1 times [2024-05-12 11:10:56,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:56,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542142462] [2024-05-12 11:10:56,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:56,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:56,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:56,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542142462] [2024-05-12 11:10:56,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542142462] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1350822343] [2024-05-12 11:10:56,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:56,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:56,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:56,319 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-05-12 11:10:56,322 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-05-12 11:10:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:56,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-12 11:10:56,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:56,445 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:56,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:56,546 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:56,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1350822343] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:56,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:56,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2024-05-12 11:10:56,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916032764] [2024-05-12 11:10:56,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:56,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-05-12 11:10:56,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:56,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-05-12 11:10:56,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-05-12 11:10:56,701 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:56,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 74 transitions, 1021 flow. Second operand has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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-05-12 11:10:56,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:56,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:56,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:57,373 INFO L124 PetriNetUnfolderBase]: 1198/2243 cut-off events. [2024-05-12 11:10:57,373 INFO L125 PetriNetUnfolderBase]: For 70383/70383 co-relation queries the response was YES. [2024-05-12 11:10:57,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14391 conditions, 2243 events. 1198/2243 cut-off events. For 70383/70383 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 11918 event pairs, 206 based on Foata normal form. 63/2298 useless extension candidates. Maximal degree in co-relation 14329. Up to 616 conditions per place. [2024-05-12 11:10:57,410 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 101 selfloop transitions, 51 changer transitions 67/223 dead transitions. [2024-05-12 11:10:57,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 223 transitions, 3295 flow [2024-05-12 11:10:57,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-05-12 11:10:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-05-12 11:10:57,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 387 transitions. [2024-05-12 11:10:57,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.516 [2024-05-12 11:10:57,414 INFO L175 Difference]: Start difference. First operand has 125 places, 74 transitions, 1021 flow. Second operand 25 states and 387 transitions. [2024-05-12 11:10:57,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 223 transitions, 3295 flow [2024-05-12 11:10:57,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 223 transitions, 2807 flow, removed 229 selfloop flow, removed 14 redundant places. [2024-05-12 11:10:57,508 INFO L231 Difference]: Finished difference. Result has 142 places, 84 transitions, 1287 flow [2024-05-12 11:10:57,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1287, PETRI_PLACES=142, PETRI_TRANSITIONS=84} [2024-05-12 11:10:57,510 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 110 predicate places. [2024-05-12 11:10:57,510 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 84 transitions, 1287 flow [2024-05-12 11:10:57,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.533333333333333) internal successors, (158), 15 states have internal predecessors, (158), 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-05-12 11:10:57,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:57,511 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:57,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-05-12 11:10:57,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:57,724 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-05-12 11:10:57,725 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:57,725 INFO L85 PathProgramCache]: Analyzing trace with hash 437511119, now seen corresponding path program 2 times [2024-05-12 11:10:57,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:57,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109561256] [2024-05-12 11:10:57,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:57,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:57,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109561256] [2024-05-12 11:10:57,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109561256] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:57,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357714507] [2024-05-12 11:10:57,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 11:10:57,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:57,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:57,873 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-05-12 11:10:57,887 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-05-12 11:10:57,944 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 11:10:57,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:10:57,945 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 11 conjunts are in the unsatisfiable core [2024-05-12 11:10:57,947 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:57,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:57,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357714507] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:58,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:58,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-05-12 11:10:58,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868958432] [2024-05-12 11:10:58,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:58,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-12 11:10:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:58,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-12 11:10:58,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2024-05-12 11:10:58,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:10:58,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 84 transitions, 1287 flow. Second operand has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 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-05-12 11:10:58,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:10:58,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:10:58,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:10:59,043 INFO L124 PetriNetUnfolderBase]: 1441/2717 cut-off events. [2024-05-12 11:10:59,043 INFO L125 PetriNetUnfolderBase]: For 131134/131134 co-relation queries the response was YES. [2024-05-12 11:10:59,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19536 conditions, 2717 events. 1441/2717 cut-off events. For 131134/131134 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 14842 event pairs, 88 based on Foata normal form. 162/2871 useless extension candidates. Maximal degree in co-relation 19468. Up to 625 conditions per place. [2024-05-12 11:10:59,071 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 88 selfloop transitions, 74 changer transitions 89/255 dead transitions. [2024-05-12 11:10:59,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 255 transitions, 4473 flow [2024-05-12 11:10:59,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-05-12 11:10:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2024-05-12 11:10:59,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 402 transitions. [2024-05-12 11:10:59,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5153846153846153 [2024-05-12 11:10:59,073 INFO L175 Difference]: Start difference. First operand has 142 places, 84 transitions, 1287 flow. Second operand 26 states and 402 transitions. [2024-05-12 11:10:59,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 255 transitions, 4473 flow [2024-05-12 11:10:59,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 255 transitions, 3773 flow, removed 311 selfloop flow, removed 20 redundant places. [2024-05-12 11:10:59,208 INFO L231 Difference]: Finished difference. Result has 157 places, 103 transitions, 1795 flow [2024-05-12 11:10:59,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1010, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=1795, PETRI_PLACES=157, PETRI_TRANSITIONS=103} [2024-05-12 11:10:59,209 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 125 predicate places. [2024-05-12 11:10:59,209 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 103 transitions, 1795 flow [2024-05-12 11:10:59,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.4375) internal successors, (167), 16 states have internal predecessors, (167), 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-05-12 11:10:59,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:10:59,210 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:10:59,225 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-05-12 11:10:59,424 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,SelfDestructingSolverStorable13 [2024-05-12 11:10:59,424 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-05-12 11:10:59,425 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:10:59,425 INFO L85 PathProgramCache]: Analyzing trace with hash -707372741, now seen corresponding path program 3 times [2024-05-12 11:10:59,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:10:59,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741082424] [2024-05-12 11:10:59,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:10:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:10:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:10:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:10:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741082424] [2024-05-12 11:10:59,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741082424] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:10:59,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351990383] [2024-05-12 11:10:59,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 11:10:59,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:10:59,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:10:59,611 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-05-12 11:10:59,629 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-05-12 11:10:59,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-05-12 11:10:59,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:10:59,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-12 11:10:59,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:10:59,762 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:59,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:10:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:10:59,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351990383] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:10:59,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:10:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-05-12 11:10:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239417427] [2024-05-12 11:10:59,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:10:59,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-05-12 11:10:59,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:10:59,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-05-12 11:10:59,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=428, Unknown=0, NotChecked=0, Total=552 [2024-05-12 11:11:00,130 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:00,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 103 transitions, 1795 flow. Second operand has 24 states, 24 states have (on average 10.291666666666666) internal successors, (247), 24 states have internal predecessors, (247), 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-05-12 11:11:00,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:00,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:00,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:01,619 INFO L124 PetriNetUnfolderBase]: 2089/3824 cut-off events. [2024-05-12 11:11:01,619 INFO L125 PetriNetUnfolderBase]: For 254741/254741 co-relation queries the response was YES. [2024-05-12 11:11:01,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31509 conditions, 3824 events. 2089/3824 cut-off events. For 254741/254741 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 19567 event pairs, 54 based on Foata normal form. 144/3964 useless extension candidates. Maximal degree in co-relation 31435. Up to 865 conditions per place. [2024-05-12 11:11:01,666 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 145 selfloop transitions, 110 changer transitions 135/394 dead transitions. [2024-05-12 11:11:01,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 394 transitions, 7483 flow [2024-05-12 11:11:01,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-12 11:11:01,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-05-12 11:11:01,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 707 transitions. [2024-05-12 11:11:01,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123188405797101 [2024-05-12 11:11:01,669 INFO L175 Difference]: Start difference. First operand has 157 places, 103 transitions, 1795 flow. Second operand 46 states and 707 transitions. [2024-05-12 11:11:01,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 394 transitions, 7483 flow [2024-05-12 11:11:01,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 394 transitions, 6524 flow, removed 446 selfloop flow, removed 18 redundant places. [2024-05-12 11:11:01,852 INFO L231 Difference]: Finished difference. Result has 205 places, 137 transitions, 2860 flow [2024-05-12 11:11:01,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2860, PETRI_PLACES=205, PETRI_TRANSITIONS=137} [2024-05-12 11:11:01,853 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 173 predicate places. [2024-05-12 11:11:01,853 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 137 transitions, 2860 flow [2024-05-12 11:11:01,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 10.291666666666666) internal successors, (247), 24 states have internal predecessors, (247), 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-05-12 11:11:01,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:01,853 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:01,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:02,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-12 11:11:02,068 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-05-12 11:11:02,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:02,069 INFO L85 PathProgramCache]: Analyzing trace with hash 307858684, now seen corresponding path program 4 times [2024-05-12 11:11:02,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:02,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333238510] [2024-05-12 11:11:02,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:02,469 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:02,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:02,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333238510] [2024-05-12 11:11:02,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333238510] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:02,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928394166] [2024-05-12 11:11:02,470 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-12 11:11:02,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:02,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:02,471 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-05-12 11:11:02,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-05-12 11:11:02,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-12 11:11:02,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:02,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-12 11:11:02,562 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:02,685 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:02,685 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928394166] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:03,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:03,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-05-12 11:11:03,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926167321] [2024-05-12 11:11:03,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:03,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-12 11:11:03,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:03,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-12 11:11:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=932, Unknown=0, NotChecked=0, Total=1190 [2024-05-12 11:11:03,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:03,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 137 transitions, 2860 flow. Second operand has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:03,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:03,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:03,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:04,950 INFO L124 PetriNetUnfolderBase]: 2287/4391 cut-off events. [2024-05-12 11:11:04,951 INFO L125 PetriNetUnfolderBase]: For 489122/489122 co-relation queries the response was YES. [2024-05-12 11:11:04,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41538 conditions, 4391 events. 2287/4391 cut-off events. For 489122/489122 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 24441 event pairs, 540 based on Foata normal form. 90/4473 useless extension candidates. Maximal degree in co-relation 41446. Up to 1936 conditions per place. [2024-05-12 11:11:05,011 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 190 selfloop transitions, 89 changer transitions 119/402 dead transitions. [2024-05-12 11:11:05,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 402 transitions, 9689 flow [2024-05-12 11:11:05,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-05-12 11:11:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2024-05-12 11:11:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 661 transitions. [2024-05-12 11:11:05,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48962962962962964 [2024-05-12 11:11:05,013 INFO L175 Difference]: Start difference. First operand has 205 places, 137 transitions, 2860 flow. Second operand 45 states and 661 transitions. [2024-05-12 11:11:05,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 402 transitions, 9689 flow [2024-05-12 11:11:05,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 402 transitions, 7058 flow, removed 1275 selfloop flow, removed 26 redundant places. [2024-05-12 11:11:05,541 INFO L231 Difference]: Finished difference. Result has 228 places, 169 transitions, 3016 flow [2024-05-12 11:11:05,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=1965, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=3016, PETRI_PLACES=228, PETRI_TRANSITIONS=169} [2024-05-12 11:11:05,542 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 196 predicate places. [2024-05-12 11:11:05,542 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 169 transitions, 3016 flow [2024-05-12 11:11:05,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:05,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:05,543 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:05,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:05,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:05,756 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-05-12 11:11:05,757 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:05,757 INFO L85 PathProgramCache]: Analyzing trace with hash 564000438, now seen corresponding path program 5 times [2024-05-12 11:11:05,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:05,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541340415] [2024-05-12 11:11:05,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:05,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:06,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541340415] [2024-05-12 11:11:06,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541340415] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:06,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441105759] [2024-05-12 11:11:06,074 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-12 11:11:06,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:06,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:06,075 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-05-12 11:11:06,093 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-05-12 11:11:06,160 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-12 11:11:06,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:06,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-12 11:11:06,170 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:06,292 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:06,293 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441105759] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:06,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2024-05-12 11:11:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487380666] [2024-05-12 11:11:06,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:06,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-05-12 11:11:06,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:06,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-05-12 11:11:06,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2024-05-12 11:11:07,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:07,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 169 transitions, 3016 flow. Second operand has 36 states, 36 states have (on average 10.222222222222221) internal successors, (368), 36 states have internal predecessors, (368), 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-05-12 11:11:07,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:07,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:07,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:09,457 INFO L124 PetriNetUnfolderBase]: 2755/5445 cut-off events. [2024-05-12 11:11:09,457 INFO L125 PetriNetUnfolderBase]: For 532669/532669 co-relation queries the response was YES. [2024-05-12 11:11:09,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46934 conditions, 5445 events. 2755/5445 cut-off events. For 532669/532669 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 32345 event pairs, 286 based on Foata normal form. 108/5549 useless extension candidates. Maximal degree in co-relation 46841. Up to 1333 conditions per place. [2024-05-12 11:11:09,513 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 183 selfloop transitions, 169 changer transitions 145/501 dead transitions. [2024-05-12 11:11:09,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 501 transitions, 10607 flow [2024-05-12 11:11:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-05-12 11:11:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-05-12 11:11:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 789 transitions. [2024-05-12 11:11:09,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962264150943396 [2024-05-12 11:11:09,516 INFO L175 Difference]: Start difference. First operand has 228 places, 169 transitions, 3016 flow. Second operand 53 states and 789 transitions. [2024-05-12 11:11:09,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 501 transitions, 10607 flow [2024-05-12 11:11:10,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 501 transitions, 9557 flow, removed 466 selfloop flow, removed 26 redundant places. [2024-05-12 11:11:10,223 INFO L231 Difference]: Finished difference. Result has 267 places, 220 transitions, 4447 flow [2024-05-12 11:11:10,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=2546, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=4447, PETRI_PLACES=267, PETRI_TRANSITIONS=220} [2024-05-12 11:11:10,224 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 235 predicate places. [2024-05-12 11:11:10,224 INFO L495 AbstractCegarLoop]: Abstraction has has 267 places, 220 transitions, 4447 flow [2024-05-12 11:11:10,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 10.222222222222221) internal successors, (368), 36 states have internal predecessors, (368), 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-05-12 11:11:10,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:10,224 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:10,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:10,435 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,SelfDestructingSolverStorable16 [2024-05-12 11:11:10,435 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-05-12 11:11:10,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:10,436 INFO L85 PathProgramCache]: Analyzing trace with hash 804338400, now seen corresponding path program 6 times [2024-05-12 11:11:10,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:10,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077713428] [2024-05-12 11:11:10,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:10,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:10,736 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:10,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077713428] [2024-05-12 11:11:10,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077713428] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:10,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791067186] [2024-05-12 11:11:10,737 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-12 11:11:10,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:10,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:10,739 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-05-12 11:11:10,741 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-05-12 11:11:10,823 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-12 11:11:10,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:10,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjunts are in the unsatisfiable core [2024-05-12 11:11:10,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:10,925 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:11,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791067186] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:11,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:11,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-05-12 11:11:11,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548402018] [2024-05-12 11:11:11,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:11,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-12 11:11:11,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:11,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-12 11:11:11,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2024-05-12 11:11:11,452 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:11,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 220 transitions, 4447 flow. Second operand has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:11,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:11,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:11,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:14,071 INFO L124 PetriNetUnfolderBase]: 3214/6378 cut-off events. [2024-05-12 11:11:14,071 INFO L125 PetriNetUnfolderBase]: For 881456/881456 co-relation queries the response was YES. [2024-05-12 11:11:14,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63269 conditions, 6378 events. 3214/6378 cut-off events. For 881456/881456 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 39146 event pairs, 130 based on Foata normal form. 108/6478 useless extension candidates. Maximal degree in co-relation 63164. Up to 1579 conditions per place. [2024-05-12 11:11:14,138 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 195 selfloop transitions, 219 changer transitions 125/543 dead transitions. [2024-05-12 11:11:14,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 543 transitions, 12975 flow [2024-05-12 11:11:14,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2024-05-12 11:11:14,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2024-05-12 11:11:14,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 776 transitions. [2024-05-12 11:11:14,141 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071895424836601 [2024-05-12 11:11:14,141 INFO L175 Difference]: Start difference. First operand has 267 places, 220 transitions, 4447 flow. Second operand 51 states and 776 transitions. [2024-05-12 11:11:14,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 543 transitions, 12975 flow [2024-05-12 11:11:15,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 543 transitions, 11355 flow, removed 725 selfloop flow, removed 28 redundant places. [2024-05-12 11:11:15,327 INFO L231 Difference]: Finished difference. Result has 303 places, 259 transitions, 5507 flow [2024-05-12 11:11:15,328 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=3533, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=183, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=51, PETRI_FLOW=5507, PETRI_PLACES=303, PETRI_TRANSITIONS=259} [2024-05-12 11:11:15,328 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 271 predicate places. [2024-05-12 11:11:15,328 INFO L495 AbstractCegarLoop]: Abstraction has has 303 places, 259 transitions, 5507 flow [2024-05-12 11:11:15,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 10.228571428571428) internal successors, (358), 35 states have internal predecessors, (358), 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-05-12 11:11:15,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:15,329 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:15,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:15,529 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,SelfDestructingSolverStorable17 [2024-05-12 11:11:15,530 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-05-12 11:11:15,530 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:15,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1913861890, now seen corresponding path program 7 times [2024-05-12 11:11:15,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:15,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109769341] [2024-05-12 11:11:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:15,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109769341] [2024-05-12 11:11:15,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109769341] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:15,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867744206] [2024-05-12 11:11:15,828 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-12 11:11:15,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:15,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:15,832 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-05-12 11:11:15,848 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-05-12 11:11:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:15,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 20 conjunts are in the unsatisfiable core [2024-05-12 11:11:15,925 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:16,014 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:16,014 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:16,272 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:16,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867744206] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:16,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:16,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 34 [2024-05-12 11:11:16,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600384423] [2024-05-12 11:11:16,276 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:16,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-05-12 11:11:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:16,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-05-12 11:11:16,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=931, Unknown=0, NotChecked=0, Total=1190 [2024-05-12 11:11:16,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 30 [2024-05-12 11:11:16,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 259 transitions, 5507 flow. Second operand has 35 states, 35 states have (on average 8.228571428571428) internal successors, (288), 35 states have internal predecessors, (288), 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-05-12 11:11:16,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:16,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 30 [2024-05-12 11:11:16,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:18,856 INFO L124 PetriNetUnfolderBase]: 3313/6574 cut-off events. [2024-05-12 11:11:18,856 INFO L125 PetriNetUnfolderBase]: For 1137893/1137893 co-relation queries the response was YES. [2024-05-12 11:11:18,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70145 conditions, 6574 events. 3313/6574 cut-off events. For 1137893/1137893 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 40583 event pairs, 58 based on Foata normal form. 153/6723 useless extension candidates. Maximal degree in co-relation 70026. Up to 1615 conditions per place. [2024-05-12 11:11:18,920 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 169 selfloop transitions, 243 changer transitions 140/556 dead transitions. [2024-05-12 11:11:18,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 556 transitions, 14437 flow [2024-05-12 11:11:18,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-05-12 11:11:18,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2024-05-12 11:11:18,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 663 transitions. [2024-05-12 11:11:18,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.442 [2024-05-12 11:11:18,925 INFO L175 Difference]: Start difference. First operand has 303 places, 259 transitions, 5507 flow. Second operand 50 states and 663 transitions. [2024-05-12 11:11:18,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 556 transitions, 14437 flow [2024-05-12 11:11:20,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 556 transitions, 12301 flow, removed 966 selfloop flow, removed 29 redundant places. [2024-05-12 11:11:20,587 INFO L231 Difference]: Finished difference. Result has 333 places, 274 transitions, 6086 flow [2024-05-12 11:11:20,587 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4465, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=229, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=6086, PETRI_PLACES=333, PETRI_TRANSITIONS=274} [2024-05-12 11:11:20,587 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 301 predicate places. [2024-05-12 11:11:20,587 INFO L495 AbstractCegarLoop]: Abstraction has has 333 places, 274 transitions, 6086 flow [2024-05-12 11:11:20,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 8.228571428571428) internal successors, (288), 35 states have internal predecessors, (288), 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-05-12 11:11:20,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:20,588 INFO L208 CegarLoopForPetriNet]: trace histogram [9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:20,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-05-12 11:11:20,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:20,789 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:20,789 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1610606960, now seen corresponding path program 8 times [2024-05-12 11:11:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667692890] [2024-05-12 11:11:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:21,133 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:21,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:21,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667692890] [2024-05-12 11:11:21,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667692890] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:21,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855581872] [2024-05-12 11:11:21,134 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-12 11:11:21,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:21,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:21,135 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:21,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-12 11:11:21,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-12 11:11:21,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:21,211 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 27 conjunts are in the unsatisfiable core [2024-05-12 11:11:21,212 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:21,689 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:21,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:22,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855581872] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:22,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:22,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24, 24] total 63 [2024-05-12 11:11:22,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288763124] [2024-05-12 11:11:22,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:22,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-12 11:11:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:22,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-12 11:11:22,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2024-05-12 11:11:22,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 30 [2024-05-12 11:11:22,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 274 transitions, 6086 flow. Second operand has 64 states, 64 states have (on average 7.171875) internal successors, (459), 64 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-05-12 11:11:22,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:22,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 30 [2024-05-12 11:11:22,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:28,211 INFO L124 PetriNetUnfolderBase]: 5971/11633 cut-off events. [2024-05-12 11:11:28,212 INFO L125 PetriNetUnfolderBase]: For 2187715/2187715 co-relation queries the response was YES. [2024-05-12 11:11:28,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126305 conditions, 11633 events. 5971/11633 cut-off events. For 2187715/2187715 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 76965 event pairs, 90 based on Foata normal form. 99/11728 useless extension candidates. Maximal degree in co-relation 126177. Up to 2852 conditions per place. [2024-05-12 11:11:28,376 INFO L140 encePairwiseOnDemand]: 21/30 looper letters, 298 selfloop transitions, 455 changer transitions 196/952 dead transitions. [2024-05-12 11:11:28,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 952 transitions, 24145 flow [2024-05-12 11:11:28,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2024-05-12 11:11:28,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2024-05-12 11:11:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 1041 transitions. [2024-05-12 11:11:28,381 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4082352941176471 [2024-05-12 11:11:28,381 INFO L175 Difference]: Start difference. First operand has 333 places, 274 transitions, 6086 flow. Second operand 85 states and 1041 transitions. [2024-05-12 11:11:28,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 952 transitions, 24145 flow [2024-05-12 11:11:34,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 952 transitions, 21533 flow, removed 994 selfloop flow, removed 41 redundant places. [2024-05-12 11:11:34,275 INFO L231 Difference]: Finished difference. Result has 406 places, 486 transitions, 11962 flow [2024-05-12 11:11:34,275 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=4901, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=245, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=85, PETRI_FLOW=11962, PETRI_PLACES=406, PETRI_TRANSITIONS=486} [2024-05-12 11:11:34,275 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 374 predicate places. [2024-05-12 11:11:34,276 INFO L495 AbstractCegarLoop]: Abstraction has has 406 places, 486 transitions, 11962 flow [2024-05-12 11:11:34,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 7.171875) internal successors, (459), 64 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-05-12 11:11:34,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:34,276 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:34,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:34,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:34,483 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:34,483 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1498270245, now seen corresponding path program 9 times [2024-05-12 11:11:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:34,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061535466] [2024-05-12 11:11:34,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:34,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-12 11:11:34,865 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:34,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-12 11:11:34,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061535466] [2024-05-12 11:11:34,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061535466] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-12 11:11:34,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387237426] [2024-05-12 11:11:34,866 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-12 11:11:34,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-12 11:11:34,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-05-12 11:11:34,867 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-12 11:11:34,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-12 11:11:34,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2024-05-12 11:11:34,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-12 11:11:34,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 26 conjunts are in the unsatisfiable core [2024-05-12 11:11:34,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-12 11:11:35,058 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:35,059 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-12 11:11:35,260 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-12 11:11:35,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387237426] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-12 11:11:35,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-12 11:11:35,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 25 [2024-05-12 11:11:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616518092] [2024-05-12 11:11:35,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-12 11:11:35,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-05-12 11:11:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-12 11:11:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-05-12 11:11:35,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=516, Unknown=0, NotChecked=0, Total=650 [2024-05-12 11:11:35,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 30 [2024-05-12 11:11:35,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 486 transitions, 11962 flow. Second operand has 26 states, 26 states have (on average 10.0) internal successors, (260), 26 states have internal predecessors, (260), 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-05-12 11:11:35,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-05-12 11:11:35,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 30 [2024-05-12 11:11:35,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-05-12 11:11:39,936 INFO L124 PetriNetUnfolderBase]: 5228/10485 cut-off events. [2024-05-12 11:11:39,937 INFO L125 PetriNetUnfolderBase]: For 2645864/2646083 co-relation queries the response was YES. [2024-05-12 11:11:40,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125847 conditions, 10485 events. 5228/10485 cut-off events. For 2645864/2646083 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 71450 event pairs, 271 based on Foata normal form. 103/10433 useless extension candidates. Maximal degree in co-relation 125690. Up to 2726 conditions per place. [2024-05-12 11:11:40,224 INFO L140 encePairwiseOnDemand]: 24/30 looper letters, 205 selfloop transitions, 426 changer transitions 90/735 dead transitions. [2024-05-12 11:11:40,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 735 transitions, 20603 flow [2024-05-12 11:11:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-05-12 11:11:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2024-05-12 11:11:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 669 transitions. [2024-05-12 11:11:40,229 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5068181818181818 [2024-05-12 11:11:40,230 INFO L175 Difference]: Start difference. First operand has 406 places, 486 transitions, 11962 flow. Second operand 44 states and 669 transitions. [2024-05-12 11:11:40,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 735 transitions, 20603 flow [2024-05-12 11:11:49,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 735 transitions, 15110 flow, removed 2413 selfloop flow, removed 42 redundant places. [2024-05-12 11:11:49,114 INFO L231 Difference]: Finished difference. Result has 403 places, 493 transitions, 9647 flow [2024-05-12 11:11:49,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=8577, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=420, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=9647, PETRI_PLACES=403, PETRI_TRANSITIONS=493} [2024-05-12 11:11:49,115 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 371 predicate places. [2024-05-12 11:11:49,115 INFO L495 AbstractCegarLoop]: Abstraction has has 403 places, 493 transitions, 9647 flow [2024-05-12 11:11:49,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 10.0) internal successors, (260), 26 states have internal predecessors, (260), 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-05-12 11:11:49,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-05-12 11:11:49,116 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:49,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-12 11:11:49,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-12 11:11:49,316 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-05-12 11:11:49,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-12 11:11:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1139124861, now seen corresponding path program 10 times [2024-05-12 11:11:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-12 11:11:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122261381] [2024-05-12 11:11:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-12 11:11:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-12 11:11:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 11:11:49,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-05-12 11:11:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-05-12 11:11:49,378 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-05-12 11:11:49,379 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-05-12 11:11:49,380 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-05-12 11:11:49,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 5 remaining) [2024-05-12 11:11:49,381 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 5 remaining) [2024-05-12 11:11:49,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2024-05-12 11:11:49,382 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-05-12 11:11:49,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-05-12 11:11:49,382 INFO L445 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-05-12 11:11:49,388 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-12 11:11:49,388 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-12 11:11:49,506 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-05-12 11:11:49,507 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-05-12 11:11:49,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.05 11:11:49 BasicIcfg [2024-05-12 11:11:49,507 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-12 11:11:49,508 INFO L158 Benchmark]: Toolchain (without parser) took 63256.84ms. Allocated memory was 161.5MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 109.8MB in the beginning and 6.1GB in the end (delta: -6.0GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-05-12 11:11:49,508 INFO L158 Benchmark]: Witness Parser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:11:49,508 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:11:49,509 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.51ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 84.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-05-12 11:11:49,509 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.04ms. Allocated memory is still 161.5MB. Free memory was 84.7MB in the beginning and 82.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-05-12 11:11:49,509 INFO L158 Benchmark]: Boogie Preprocessor took 62.45ms. Allocated memory is still 161.5MB. Free memory was 82.5MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-05-12 11:11:49,510 INFO L158 Benchmark]: RCFGBuilder took 491.38ms. Allocated memory is still 161.5MB. Free memory was 79.8MB in the beginning and 56.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-05-12 11:11:49,510 INFO L158 Benchmark]: TraceAbstraction took 62031.05ms. Allocated memory was 161.5MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 55.3MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2024-05-12 11:11:49,511 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.18ms. Allocated memory is still 161.5MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.19ms. Allocated memory is still 161.5MB. Free memory is still 121.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.51ms. Allocated memory is still 161.5MB. Free memory was 109.8MB in the beginning and 84.7MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.04ms. Allocated memory is still 161.5MB. Free memory was 84.7MB in the beginning and 82.5MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 62.45ms. Allocated memory is still 161.5MB. Free memory was 82.5MB in the beginning and 79.8MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 491.38ms. Allocated memory is still 161.5MB. Free memory was 79.8MB in the beginning and 56.0MB in the end (delta: 23.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 62031.05ms. Allocated memory was 161.5MB in the beginning and 7.2GB in the end (delta: 7.1GB). Free memory was 55.3MB in the beginning and 6.1GB in the end (delta: -6.1GB). Peak memory consumption was 1.0GB. 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; VAL [\old(argc)=51, \old(argv)={49:50}, argc=51, i=3, id1={5:0}, id2={3:0}, j=6] [L713] 0 //@ ghost multithreaded = 1; [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={5:0}, id2={3:0}, j=6] [L696] 1 int k = 0; VAL [\old(arg)={0:0}, arg={0:0}, i=3, j=6, k=0] [L714] 0 //@ assert ((((!multithreaded || (((((0 <= j) && (4 <= j)) && ((j % 2) == 0)) && (j != 0)) && (j != 1))) && (!multithreaded || ((((-7LL + (long long) i) + (long long) j) >= 0LL) && (((1LL - (long long) i) + (long long) j) >= 0LL)))) && (!multithreaded || (((((((((0 <= i) && (0 <= j)) && (3 <= i)) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)) && (i != 0)) && (j != 0)) && (j != 1)))) && (!multithreaded || ((((0 <= i) && (3 <= i)) && ((i % 2) == 1)) && (i != 0)))); [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={5:0}, id2={3: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] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=3, j=6, k=0, k=0] [L696] COND TRUE 1 k < 10 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] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=0, k=1] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=7, j=8, k=1, k=1] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=1] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=8, k=1, k=2] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=1, k=2] [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] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=9, j=10, k=2, k=2] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=2] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=10, k=2, k=3] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=2, k=3] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=11, j=12, k=3, k=3] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=3] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=12, k=3, k=4] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=3, k=4] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=13, j=14, k=4, k=4] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=4] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=14, k=4, k=5] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=4, k=5] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=15, j=16, k=5, k=5] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=5] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=17, j=16, k=5, k=6] [L704] COND TRUE 2 k < 10 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 < 10 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 < 10 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] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=6, k=7] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=19, j=20, k=7, k=7] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=7] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=20, k=7, k=8] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=7, k=8] [L704] 2 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=21, j=22, k=8, k=8] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=8] [L696] 1 k++ VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=9] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=22, k=8, k=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] [L704] COND TRUE 2 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L715] 0 //@ assert ((((!multithreaded || (((((0 <= j) && (4 <= j)) && ((j % 2) == 0)) && (j != 0)) && (j != 1))) && (!multithreaded || ((((-7LL + (long long) i) + (long long) j) >= 0LL) && (((1LL - (long long) i) + (long long) j) >= 0LL)))) && (!multithreaded || (((((((((0 <= i) && (0 <= j)) && (3 <= i)) && (4 <= j)) && ((i % 2) == 1)) && ((j % 2) == 0)) && (i != 0)) && (j != 0)) && (j != 1)))) && (!multithreaded || ((((0 <= i) && (3 <= i)) && ((i % 2) == 1)) && (i != 0)))); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, i=23, id1={5:0}, id2={3:0}, j=24, k=9, k=9] [L716] 0 int condI = i >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, i=23, id1={5:0}, id2={3:0}, j=24, k=9, k=9] [L696] COND TRUE 1 k < 10 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=23, j=24, k=9, k=9] [L698] 1 i = j + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=24, k=9, k=9] [L706] 2 j = i + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, arg={0:0}, arg={0:0}, i=25, j=26, k=9, k=9] [L719] 0 int condJ = j >= (2*10 +6); VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] [L721] COND TRUE 0 condI || condJ VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] [L722] 0 reach_error() VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(argc)=51, \old(argv)={49:50}, arg={0:0}, arg={0:0}, argc=51, condI=0, condJ=1, i=25, id1={5:0}, id2={3:0}, j=26, k=9, k=9] - UnprovableResult [Line: 714]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that invariant of correctness witness holds Unable to prove that invariant of correctness witness holds Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 40 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: 61.8s, OverallIterations: 22, TraceHistogramMax: 10, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 48.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8426 SdHoareTripleChecker+Valid, 7.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8226 mSDsluCounter, 606 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 578 mSDsCounter, 464 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13375 IncrementalHoareTripleChecker+Invalid, 13839 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 464 mSolverCounterUnsat, 28 mSDtfsCounter, 13375 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1637 GetRequests, 837 SyntacticMatches, 18 SemanticMatches, 782 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18123 ImplicationChecksByTransitivity, 9.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11962occurred in iteration=20, InterpolantAutomatonStates: 545, 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.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1216 NumberOfCodeBlocks, 1216 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 1607 ConstructedInterpolants, 0 QuantifiedInterpolants, 7793 SizeOfPredicates, 131 NumberOfNonLiveVariables, 1942 ConjunctsInSsa, 206 ConjunctsInUnsatCore, 45 InterpolantComputations, 9 PerfectInterpolantSequences, 3/2784 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-05-12 11:11:49,546 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