./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 273a578a 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/AutomizerReach.xml -i ../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 739dc04b5c5aa67083a96cc98ccb84e17de2a97ca235c28aa84e8c99a10b0a9e --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-273a578-m [2024-02-19 14:50:59,517 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-19 14:50:59,584 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-19 14:50:59,589 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-19 14:50:59,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-19 14:50:59,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-19 14:50:59,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-19 14:50:59,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-19 14:50:59,626 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-19 14:50:59,629 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-19 14:50:59,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-19 14:50:59,630 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-19 14:50:59,630 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-19 14:50:59,631 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-19 14:50:59,631 INFO L153 SettingsManager]: * Use SBE=true [2024-02-19 14:50:59,631 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-19 14:50:59,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-19 14:50:59,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-19 14:50:59,632 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-19 14:50:59,632 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-19 14:50:59,632 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-19 14:50:59,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-19 14:50:59,633 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-19 14:50:59,633 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-19 14:50:59,633 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-19 14:50:59,634 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-19 14:50:59,634 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-19 14:50:59,634 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-19 14:50:59,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-19 14:50:59,635 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-19 14:50:59,635 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-19 14:50:59,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-19 14:50:59,636 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:50:59,636 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-19 14:50:59,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-19 14:50:59,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-19 14:50:59,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-19 14:50:59,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-19 14:50:59,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-19 14:50:59,637 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-19 14:50:59,637 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-19 14:50:59,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-19 14:50:59,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-19 14:50:59,638 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 739dc04b5c5aa67083a96cc98ccb84e17de2a97ca235c28aa84e8c99a10b0a9e Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-19 14:50:59,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-19 14:50:59,906 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-19 14:50:59,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-19 14:50:59,910 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-19 14:50:59,910 INFO L274 PluginConnector]: CDTParser initialized [2024-02-19 14:50:59,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c [2024-02-19 14:51:00,897 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-19 14:51:01,056 INFO L384 CDTParser]: Found 1 translation units. [2024-02-19 14:51:01,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c [2024-02-19 14:51:01,072 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28a4d4dc/d901fc171b244533aa9ed786afa257eb/FLAG6d180b14a [2024-02-19 14:51:01,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e28a4d4dc/d901fc171b244533aa9ed786afa257eb [2024-02-19 14:51:01,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-19 14:51:01,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-19 14:51:01,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-19 14:51:01,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-19 14:51:01,093 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-19 14:51:01,093 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,094 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33a4e8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01, skipping insertion in model container [2024-02-19 14:51:01,094 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,111 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-19 14:51:01,274 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c[2507,2520] [2024-02-19 14:51:01,280 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:51:01,289 INFO L202 MainTranslator]: Completed pre-run [2024-02-19 14:51:01,321 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-difference-det.wvr.c[2507,2520] [2024-02-19 14:51:01,323 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-19 14:51:01,336 INFO L206 MainTranslator]: Completed translation [2024-02-19 14:51:01,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01 WrapperNode [2024-02-19 14:51:01,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-19 14:51:01,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-19 14:51:01,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-19 14:51:01,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-19 14:51:01,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,382 INFO L138 Inliner]: procedures = 23, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 123 [2024-02-19 14:51:01,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-19 14:51:01,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-19 14:51:01,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-19 14:51:01,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-19 14:51:01,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,401 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,422 INFO L175 MemorySlicer]: Split 10 memory accesses to 5 slices as follows [2, 2, 2, 2, 2]. 20 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2024-02-19 14:51:01,423 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,423 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,434 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,441 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-19 14:51:01,449 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-19 14:51:01,449 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-19 14:51:01,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-19 14:51:01,450 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (1/1) ... [2024-02-19 14:51:01,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-19 14:51:01,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:51:01,474 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-02-19 14:51:01,477 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-02-19 14:51:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-19 14:51:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-19 14:51:01,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-19 14:51:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-19 14:51:01,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-19 14:51:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-02-19 14:51:01,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-02-19 14:51:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-02-19 14:51:01,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-02-19 14:51:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-19 14:51:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-19 14:51:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-19 14:51:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-02-19 14:51:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-02-19 14:51:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-02-19 14:51:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-02-19 14:51:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-19 14:51:01,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-19 14:51:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-19 14:51:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-19 14:51:01,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-19 14:51:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-02-19 14:51:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-02-19 14:51:01,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-19 14:51:01,530 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-19 14:51:01,632 INFO L244 CfgBuilder]: Building ICFG [2024-02-19 14:51:01,635 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-19 14:51:01,888 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-19 14:51:01,888 INFO L293 CfgBuilder]: Performing block encoding [2024-02-19 14:51:01,990 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-19 14:51:01,992 INFO L320 CfgBuilder]: Removed 4 assume(true) statements. [2024-02-19 14:51:01,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:51:01 BoogieIcfgContainer [2024-02-19 14:51:01,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-19 14:51:01,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-19 14:51:01,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-19 14:51:01,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-19 14:51:01,997 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.02 02:51:01" (1/3) ... [2024-02-19 14:51:01,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1f411b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:51:01, skipping insertion in model container [2024-02-19 14:51:01,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.02 02:51:01" (2/3) ... [2024-02-19 14:51:01,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c1f411b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.02 02:51:01, skipping insertion in model container [2024-02-19 14:51:01,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.02 02:51:01" (3/3) ... [2024-02-19 14:51:02,000 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-difference-det.wvr.c [2024-02-19 14:51:02,023 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-19 14:51:02,023 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-19 14:51:02,023 INFO L631 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-19 14:51:02,063 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-02-19 14:51:02,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 43 transitions, 114 flow [2024-02-19 14:51:02,127 INFO L124 PetriNetUnfolderBase]: 4/39 cut-off events. [2024-02-19 14:51:02,127 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:51:02,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 39 events. 4/39 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-02-19 14:51:02,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 43 transitions, 114 flow [2024-02-19 14:51:02,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 38 transitions, 100 flow [2024-02-19 14:51:02,152 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-19 14:51:02,159 INFO L369 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@6c0e5218, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-19 14:51:02,159 INFO L370 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-02-19 14:51:02,178 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-19 14:51:02,178 INFO L124 PetriNetUnfolderBase]: 4/37 cut-off events. [2024-02-19 14:51:02,178 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-02-19 14:51:02,178 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:02,179 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:02,179 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:02,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1329253333, now seen corresponding path program 1 times [2024-02-19 14:51:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:02,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034257354] [2024-02-19 14:51:02,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:02,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:02,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:02,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:02,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034257354] [2024-02-19 14:51:02,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034257354] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:02,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:02,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:51:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828885896] [2024-02-19 14:51:02,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:02,508 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:51:02,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:02,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:51:02,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:51:02,546 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:51:02,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-19 14:51:02,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:02,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:51:02,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:03,042 INFO L124 PetriNetUnfolderBase]: 3654/5032 cut-off events. [2024-02-19 14:51:03,043 INFO L125 PetriNetUnfolderBase]: For 321/321 co-relation queries the response was YES. [2024-02-19 14:51:03,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9916 conditions, 5032 events. 3654/5032 cut-off events. For 321/321 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 24025 event pairs, 589 based on Foata normal form. 1/4994 useless extension candidates. Maximal degree in co-relation 8059. Up to 4380 conditions per place. [2024-02-19 14:51:03,087 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 45 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-02-19 14:51:03,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 267 flow [2024-02-19 14:51:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:51:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:51:03,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2024-02-19 14:51:03,098 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7054263565891473 [2024-02-19 14:51:03,100 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-02-19 14:51:03,101 INFO L507 AbstractCegarLoop]: Abstraction has has 49 places, 60 transitions, 267 flow [2024-02-19 14:51:03,101 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-02-19 14:51:03,101 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:03,101 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:03,102 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-19 14:51:03,102 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:03,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:03,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1623375705, now seen corresponding path program 1 times [2024-02-19 14:51:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:03,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651609668] [2024-02-19 14:51:03,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:03,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651609668] [2024-02-19 14:51:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651609668] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:03,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:03,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:03,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237892337] [2024-02-19 14:51:03,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:03,249 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:03,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:03,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:03,254 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:51:03,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 60 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:03,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:03,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:51:03,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:03,997 INFO L124 PetriNetUnfolderBase]: 7103/9850 cut-off events. [2024-02-19 14:51:03,997 INFO L125 PetriNetUnfolderBase]: For 2473/2733 co-relation queries the response was YES. [2024-02-19 14:51:04,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27678 conditions, 9850 events. 7103/9850 cut-off events. For 2473/2733 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 53757 event pairs, 893 based on Foata normal form. 52/9858 useless extension candidates. Maximal degree in co-relation 23307. Up to 7697 conditions per place. [2024-02-19 14:51:04,054 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 133 selfloop transitions, 7 changer transitions 1/147 dead transitions. [2024-02-19 14:51:04,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 147 transitions, 937 flow [2024-02-19 14:51:04,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:04,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:04,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-02-19 14:51:04,059 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6325581395348837 [2024-02-19 14:51:04,059 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 6 predicate places. [2024-02-19 14:51:04,060 INFO L507 AbstractCegarLoop]: Abstraction has has 53 places, 147 transitions, 937 flow [2024-02-19 14:51:04,060 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:04,060 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:04,061 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:04,061 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-19 14:51:04,063 INFO L432 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:04,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 736065303, now seen corresponding path program 2 times [2024-02-19 14:51:04,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:04,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076447405] [2024-02-19 14:51:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:04,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:04,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:04,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076447405] [2024-02-19 14:51:04,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076447405] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:51:04,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754170814] [2024-02-19 14:51:04,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:51:04,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:51:04,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:51:04,177 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-02-19 14:51:04,182 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-02-19 14:51:04,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:51:04,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:51:04,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:51:04,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:51:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:04,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:51:04,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:04,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754170814] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:51:04,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:51:04,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-02-19 14:51:04,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847263880] [2024-02-19 14:51:04,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:51:04,407 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 14:51:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:04,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 14:51:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:51:04,414 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:04,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 147 transitions, 937 flow. Second operand has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 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-02-19 14:51:04,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:04,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:04,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:06,247 INFO L124 PetriNetUnfolderBase]: 18802/24276 cut-off events. [2024-02-19 14:51:06,247 INFO L125 PetriNetUnfolderBase]: For 17837/18473 co-relation queries the response was YES. [2024-02-19 14:51:06,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93419 conditions, 24276 events. 18802/24276 cut-off events. For 17837/18473 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 130744 event pairs, 317 based on Foata normal form. 340/24598 useless extension candidates. Maximal degree in co-relation 82505. Up to 20392 conditions per place. [2024-02-19 14:51:06,406 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 531 selfloop transitions, 54 changer transitions 1/591 dead transitions. [2024-02-19 14:51:06,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 591 transitions, 4918 flow [2024-02-19 14:51:06,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:51:06,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:51:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 354 transitions. [2024-02-19 14:51:06,409 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5880398671096345 [2024-02-19 14:51:06,409 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 19 predicate places. [2024-02-19 14:51:06,409 INFO L507 AbstractCegarLoop]: Abstraction has has 66 places, 591 transitions, 4918 flow [2024-02-19 14:51:06,410 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 13.777777777777779) internal successors, (124), 9 states have internal predecessors, (124), 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-02-19 14:51:06,410 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:06,410 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:06,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-02-19 14:51:06,621 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:51:06,621 INFO L432 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:06,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1387415206, now seen corresponding path program 1 times [2024-02-19 14:51:06,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:06,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376983890] [2024-02-19 14:51:06,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:06,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:06,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376983890] [2024-02-19 14:51:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376983890] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:06,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:06,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:51:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890969902] [2024-02-19 14:51:06,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:06,669 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:51:06,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:06,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:51:06,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:51:06,670 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:51:06,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 591 transitions, 4918 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:06,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:06,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:51:06,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:08,020 INFO L124 PetriNetUnfolderBase]: 14171/18467 cut-off events. [2024-02-19 14:51:08,021 INFO L125 PetriNetUnfolderBase]: For 30411/31421 co-relation queries the response was YES. [2024-02-19 14:51:08,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87272 conditions, 18467 events. 14171/18467 cut-off events. For 30411/31421 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 99248 event pairs, 151 based on Foata normal form. 555/19006 useless extension candidates. Maximal degree in co-relation 78234. Up to 15455 conditions per place. [2024-02-19 14:51:08,231 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 538 selfloop transitions, 12 changer transitions 3/587 dead transitions. [2024-02-19 14:51:08,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 587 transitions, 5983 flow [2024-02-19 14:51:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:51:08,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:51:08,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-02-19 14:51:08,234 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7209302325581395 [2024-02-19 14:51:08,234 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 21 predicate places. [2024-02-19 14:51:08,234 INFO L507 AbstractCegarLoop]: Abstraction has has 68 places, 587 transitions, 5983 flow [2024-02-19 14:51:08,234 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:08,235 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:08,235 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:08,235 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-02-19 14:51:08,235 INFO L432 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:08,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:08,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1879510531, now seen corresponding path program 1 times [2024-02-19 14:51:08,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:08,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758750520] [2024-02-19 14:51:08,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:08,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:08,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:08,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758750520] [2024-02-19 14:51:08,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758750520] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:08,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:08,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:08,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223495794] [2024-02-19 14:51:08,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:08,309 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:08,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:08,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:08,314 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:51:08,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 587 transitions, 5983 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:08,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:08,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:51:08,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:09,835 INFO L124 PetriNetUnfolderBase]: 14287/18621 cut-off events. [2024-02-19 14:51:09,835 INFO L125 PetriNetUnfolderBase]: For 34600/37004 co-relation queries the response was YES. [2024-02-19 14:51:09,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105889 conditions, 18621 events. 14287/18621 cut-off events. For 34600/37004 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 100069 event pairs, 113 based on Foata normal form. 294/18907 useless extension candidates. Maximal degree in co-relation 101630. Up to 15561 conditions per place. [2024-02-19 14:51:09,960 INFO L140 encePairwiseOnDemand]: 37/43 looper letters, 630 selfloop transitions, 25 changer transitions 6/677 dead transitions. [2024-02-19 14:51:09,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 677 transitions, 8237 flow [2024-02-19 14:51:09,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:09,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:09,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2024-02-19 14:51:09,961 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6511627906976745 [2024-02-19 14:51:09,961 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2024-02-19 14:51:09,962 INFO L507 AbstractCegarLoop]: Abstraction has has 72 places, 677 transitions, 8237 flow [2024-02-19 14:51:09,962 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:09,962 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:09,962 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:09,962 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-02-19 14:51:09,962 INFO L432 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:09,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:09,963 INFO L85 PathProgramCache]: Analyzing trace with hash -996407482, now seen corresponding path program 1 times [2024-02-19 14:51:09,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:09,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983772687] [2024-02-19 14:51:09,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:09,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983772687] [2024-02-19 14:51:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983772687] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:09,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-02-19 14:51:09,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53643441] [2024-02-19 14:51:09,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:09,999 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-02-19 14:51:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:10,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-02-19 14:51:10,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-02-19 14:51:10,000 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:51:10,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 677 transitions, 8237 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:10,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:10,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:51:10,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:11,299 INFO L124 PetriNetUnfolderBase]: 10495/13870 cut-off events. [2024-02-19 14:51:11,299 INFO L125 PetriNetUnfolderBase]: For 36837/38165 co-relation queries the response was YES. [2024-02-19 14:51:11,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91175 conditions, 13870 events. 10495/13870 cut-off events. For 36837/38165 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 72357 event pairs, 129 based on Foata normal form. 430/14298 useless extension candidates. Maximal degree in co-relation 87788. Up to 11463 conditions per place. [2024-02-19 14:51:11,413 INFO L140 encePairwiseOnDemand]: 40/43 looper letters, 554 selfloop transitions, 12 changer transitions 52/652 dead transitions. [2024-02-19 14:51:11,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 652 transitions, 9190 flow [2024-02-19 14:51:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-02-19 14:51:11,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-02-19 14:51:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-02-19 14:51:11,414 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-02-19 14:51:11,414 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 27 predicate places. [2024-02-19 14:51:11,415 INFO L507 AbstractCegarLoop]: Abstraction has has 74 places, 652 transitions, 9190 flow [2024-02-19 14:51:11,415 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:11,415 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:11,415 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:11,415 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-02-19 14:51:11,415 INFO L432 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:11,416 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:11,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1893218019, now seen corresponding path program 2 times [2024-02-19 14:51:11,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:11,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302974995] [2024-02-19 14:51:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:11,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:11,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:11,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302974995] [2024-02-19 14:51:11,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302974995] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:51:11,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706685510] [2024-02-19 14:51:11,484 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-02-19 14:51:11,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:51:11,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:51:11,486 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-02-19 14:51:11,507 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-02-19 14:51:11,571 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-02-19 14:51:11,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-02-19 14:51:11,572 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-19 14:51:11,574 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:51:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:11,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:51:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:11,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706685510] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:51:11,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:51:11,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-02-19 14:51:11,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164660328] [2024-02-19 14:51:11,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:51:11,638 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-02-19 14:51:11,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:11,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-02-19 14:51:11,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-02-19 14:51:11,654 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:11,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 652 transitions, 9190 flow. Second operand has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-19 14:51:11,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:11,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:11,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:13,467 INFO L124 PetriNetUnfolderBase]: 12023/15844 cut-off events. [2024-02-19 14:51:13,467 INFO L125 PetriNetUnfolderBase]: For 41914/42257 co-relation queries the response was YES. [2024-02-19 14:51:13,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120031 conditions, 15844 events. 12023/15844 cut-off events. For 41914/42257 co-relation queries the response was YES. Maximal size of possible extension queue 720. Compared 83969 event pairs, 9 based on Foata normal form. 167/16008 useless extension candidates. Maximal degree in co-relation 116156. Up to 13211 conditions per place. [2024-02-19 14:51:13,596 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 858 selfloop transitions, 97 changer transitions 52/1012 dead transitions. [2024-02-19 14:51:13,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 1012 transitions, 16201 flow [2024-02-19 14:51:13,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-02-19 14:51:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-02-19 14:51:13,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 334 transitions. [2024-02-19 14:51:13,604 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5548172757475083 [2024-02-19 14:51:13,605 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 40 predicate places. [2024-02-19 14:51:13,605 INFO L507 AbstractCegarLoop]: Abstraction has has 87 places, 1012 transitions, 16201 flow [2024-02-19 14:51:13,605 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.777777777777779) internal successors, (115), 9 states have internal predecessors, (115), 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-02-19 14:51:13,605 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:13,605 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:13,619 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-02-19 14:51:13,815 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-02-19 14:51:13,815 INFO L432 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:13,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:13,816 INFO L85 PathProgramCache]: Analyzing trace with hash -95888601, now seen corresponding path program 3 times [2024-02-19 14:51:13,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:13,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373879815] [2024-02-19 14:51:13,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373879815] [2024-02-19 14:51:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373879815] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:13,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:13,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:13,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733119070] [2024-02-19 14:51:13,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:13,867 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:13,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:13,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:13,874 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:51:13,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 1012 transitions, 16201 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:13,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:13,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:51:13,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:16,132 INFO L124 PetriNetUnfolderBase]: 12759/16818 cut-off events. [2024-02-19 14:51:16,132 INFO L125 PetriNetUnfolderBase]: For 58349/58598 co-relation queries the response was YES. [2024-02-19 14:51:16,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143255 conditions, 16818 events. 12759/16818 cut-off events. For 58349/58598 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 89646 event pairs, 9 based on Foata normal form. 55/16871 useless extension candidates. Maximal degree in co-relation 138918. Up to 13911 conditions per place. [2024-02-19 14:51:16,281 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 981 selfloop transitions, 44 changer transitions 59/1109 dead transitions. [2024-02-19 14:51:16,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 1109 transitions, 19941 flow [2024-02-19 14:51:16,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:16,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:16,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-02-19 14:51:16,282 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-02-19 14:51:16,283 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 44 predicate places. [2024-02-19 14:51:16,283 INFO L507 AbstractCegarLoop]: Abstraction has has 91 places, 1109 transitions, 19941 flow [2024-02-19 14:51:16,283 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:16,283 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:16,283 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:16,283 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-02-19 14:51:16,284 INFO L432 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:16,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:16,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2057144099, now seen corresponding path program 4 times [2024-02-19 14:51:16,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:16,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624433652] [2024-02-19 14:51:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:16,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:16,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:16,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:16,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624433652] [2024-02-19 14:51:16,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624433652] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:16,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:16,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337355082] [2024-02-19 14:51:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:16,349 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:16,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:16,353 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:16,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 1109 transitions, 19941 flow. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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-02-19 14:51:16,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:16,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:16,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:18,526 INFO L124 PetriNetUnfolderBase]: 12619/16636 cut-off events. [2024-02-19 14:51:18,526 INFO L125 PetriNetUnfolderBase]: For 59104/59362 co-relation queries the response was YES. [2024-02-19 14:51:18,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158135 conditions, 16636 events. 12619/16636 cut-off events. For 59104/59362 co-relation queries the response was YES. Maximal size of possible extension queue 753. Compared 88798 event pairs, 9 based on Foata normal form. 123/16756 useless extension candidates. Maximal degree in co-relation 153308. Up to 13777 conditions per place. [2024-02-19 14:51:18,688 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 987 selfloop transitions, 42 changer transitions 59/1093 dead transitions. [2024-02-19 14:51:18,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 1093 transitions, 21803 flow [2024-02-19 14:51:18,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:18,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-02-19 14:51:18,690 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-02-19 14:51:18,690 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 48 predicate places. [2024-02-19 14:51:18,690 INFO L507 AbstractCegarLoop]: Abstraction has has 95 places, 1093 transitions, 21803 flow [2024-02-19 14:51:18,690 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 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-02-19 14:51:18,690 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:18,690 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:18,691 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-02-19 14:51:18,691 INFO L432 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:18,691 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:18,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1898574321, now seen corresponding path program 3 times [2024-02-19 14:51:18,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:18,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713182858] [2024-02-19 14:51:18,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:18,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:18,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:18,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:18,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:18,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713182858] [2024-02-19 14:51:18,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713182858] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:18,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:18,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:18,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70257470] [2024-02-19 14:51:18,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:18,751 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:18,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:18,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:18,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:18,755 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:51:18,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 1093 transitions, 21803 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:18,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:18,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:51:18,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:21,240 INFO L124 PetriNetUnfolderBase]: 12659/16714 cut-off events. [2024-02-19 14:51:21,240 INFO L125 PetriNetUnfolderBase]: For 64561/64754 co-relation queries the response was YES. [2024-02-19 14:51:21,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174641 conditions, 16714 events. 12659/16714 cut-off events. For 64561/64754 co-relation queries the response was YES. Maximal size of possible extension queue 757. Compared 89455 event pairs, 9 based on Foata normal form. 47/16759 useless extension candidates. Maximal degree in co-relation 169218. Up to 13777 conditions per place. [2024-02-19 14:51:21,411 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 968 selfloop transitions, 38 changer transitions 70/1103 dead transitions. [2024-02-19 14:51:21,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 1103 transitions, 24164 flow [2024-02-19 14:51:21,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:21,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-02-19 14:51:21,413 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-02-19 14:51:21,414 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 52 predicate places. [2024-02-19 14:51:21,414 INFO L507 AbstractCegarLoop]: Abstraction has has 99 places, 1103 transitions, 24164 flow [2024-02-19 14:51:21,414 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:21,414 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:21,414 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:21,414 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-02-19 14:51:21,414 INFO L432 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:21,414 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2023614631, now seen corresponding path program 4 times [2024-02-19 14:51:21,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:21,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340525284] [2024-02-19 14:51:21,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:21,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:21,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:21,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340525284] [2024-02-19 14:51:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340525284] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:21,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:51:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075782603] [2024-02-19 14:51:21,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:21,468 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:51:21,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:21,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:51:21,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:51:21,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:21,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 1103 transitions, 24164 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:21,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:21,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:21,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:24,261 INFO L124 PetriNetUnfolderBase]: 12907/17018 cut-off events. [2024-02-19 14:51:24,261 INFO L125 PetriNetUnfolderBase]: For 66958/67191 co-relation queries the response was YES. [2024-02-19 14:51:24,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194615 conditions, 17018 events. 12907/17018 cut-off events. For 66958/67191 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 91096 event pairs, 9 based on Foata normal form. 103/17119 useless extension candidates. Maximal degree in co-relation 188692. Up to 14005 conditions per place. [2024-02-19 14:51:24,467 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 1005 selfloop transitions, 51 changer transitions 70/1131 dead transitions. [2024-02-19 14:51:24,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 1131 transitions, 27001 flow [2024-02-19 14:51:24,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:51:24,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:51:24,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-02-19 14:51:24,469 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2024-02-19 14:51:24,469 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 57 predicate places. [2024-02-19 14:51:24,469 INFO L507 AbstractCegarLoop]: Abstraction has has 104 places, 1131 transitions, 27001 flow [2024-02-19 14:51:24,469 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:24,469 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:24,469 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:24,470 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-02-19 14:51:24,470 INFO L432 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:24,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:24,470 INFO L85 PathProgramCache]: Analyzing trace with hash -778143301, now seen corresponding path program 5 times [2024-02-19 14:51:24,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:24,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619313961] [2024-02-19 14:51:24,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:24,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:24,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:24,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619313961] [2024-02-19 14:51:24,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619313961] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:24,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:24,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:51:24,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107202173] [2024-02-19 14:51:24,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:24,545 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:51:24,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:24,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:51:24,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:51:24,554 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:24,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 1131 transitions, 27001 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:24,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:24,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:24,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:27,771 INFO L124 PetriNetUnfolderBase]: 15485/20386 cut-off events. [2024-02-19 14:51:27,772 INFO L125 PetriNetUnfolderBase]: For 82691/83235 co-relation queries the response was YES. [2024-02-19 14:51:27,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253659 conditions, 20386 events. 15485/20386 cut-off events. For 82691/83235 co-relation queries the response was YES. Maximal size of possible extension queue 957. Compared 111797 event pairs, 9 based on Foata normal form. 159/20542 useless extension candidates. Maximal degree in co-relation 246174. Up to 17063 conditions per place. [2024-02-19 14:51:28,191 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 1179 selfloop transitions, 47 changer transitions 70/1301 dead transitions. [2024-02-19 14:51:28,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 1301 transitions, 33688 flow [2024-02-19 14:51:28,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:51:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:51:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 158 transitions. [2024-02-19 14:51:28,192 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6124031007751938 [2024-02-19 14:51:28,193 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 62 predicate places. [2024-02-19 14:51:28,193 INFO L507 AbstractCegarLoop]: Abstraction has has 109 places, 1301 transitions, 33688 flow [2024-02-19 14:51:28,193 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:28,193 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:28,193 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:28,194 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-02-19 14:51:28,194 INFO L432 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:28,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash 963259293, now seen corresponding path program 5 times [2024-02-19 14:51:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887170949] [2024-02-19 14:51:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:28,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:28,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:28,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887170949] [2024-02-19 14:51:28,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887170949] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:28,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:28,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:28,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439720119] [2024-02-19 14:51:28,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:28,246 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:28,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:28,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:28,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:28,252 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:51:28,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 1301 transitions, 33688 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:28,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:28,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:51:28,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:31,892 INFO L124 PetriNetUnfolderBase]: 15461/20338 cut-off events. [2024-02-19 14:51:31,893 INFO L125 PetriNetUnfolderBase]: For 92225/92811 co-relation queries the response was YES. [2024-02-19 14:51:31,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272683 conditions, 20338 events. 15461/20338 cut-off events. For 92225/92811 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 111311 event pairs, 9 based on Foata normal form. 94/20430 useless extension candidates. Maximal degree in co-relation 264658. Up to 17063 conditions per place. [2024-02-19 14:51:32,145 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 1141 selfloop transitions, 46 changer transitions 80/1300 dead transitions. [2024-02-19 14:51:32,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 1300 transitions, 36206 flow [2024-02-19 14:51:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2024-02-19 14:51:32,146 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6232558139534884 [2024-02-19 14:51:32,146 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 66 predicate places. [2024-02-19 14:51:32,146 INFO L507 AbstractCegarLoop]: Abstraction has has 113 places, 1300 transitions, 36206 flow [2024-02-19 14:51:32,146 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:32,147 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:32,147 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:32,147 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-02-19 14:51:32,147 INFO L432 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:32,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:32,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1119795183, now seen corresponding path program 6 times [2024-02-19 14:51:32,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:32,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657453365] [2024-02-19 14:51:32,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:32,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:32,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:32,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657453365] [2024-02-19 14:51:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657453365] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:32,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:51:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356003079] [2024-02-19 14:51:32,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:32,217 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:51:32,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:32,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:51:32,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:51:32,222 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:32,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 1300 transitions, 36206 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:32,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:32,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:32,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:36,232 INFO L124 PetriNetUnfolderBase]: 16471/21641 cut-off events. [2024-02-19 14:51:36,233 INFO L125 PetriNetUnfolderBase]: For 106568/107035 co-relation queries the response was YES. [2024-02-19 14:51:36,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 311087 conditions, 21641 events. 16471/21641 cut-off events. For 106568/107035 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 118717 event pairs, 9 based on Foata normal form. 214/21852 useless extension candidates. Maximal degree in co-relation 304872. Up to 18287 conditions per place. [2024-02-19 14:51:36,514 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 1217 selfloop transitions, 50 changer transitions 80/1352 dead transitions. [2024-02-19 14:51:36,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 1352 transitions, 40331 flow [2024-02-19 14:51:36,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:51:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:51:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 156 transitions. [2024-02-19 14:51:36,515 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6046511627906976 [2024-02-19 14:51:36,515 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 71 predicate places. [2024-02-19 14:51:36,515 INFO L507 AbstractCegarLoop]: Abstraction has has 118 places, 1352 transitions, 40331 flow [2024-02-19 14:51:36,515 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:36,515 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:36,515 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:36,515 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-02-19 14:51:36,515 INFO L432 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:36,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:36,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1713458329, now seen corresponding path program 6 times [2024-02-19 14:51:36,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:36,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823338936] [2024-02-19 14:51:36,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:36,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:36,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:36,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:36,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823338936] [2024-02-19 14:51:36,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823338936] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:36,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:36,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-02-19 14:51:36,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477303811] [2024-02-19 14:51:36,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:36,568 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-02-19 14:51:36,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:36,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-02-19 14:51:36,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-02-19 14:51:36,572 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 43 [2024-02-19 14:51:36,572 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 1352 transitions, 40331 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:36,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:36,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 43 [2024-02-19 14:51:36,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:40,684 INFO L124 PetriNetUnfolderBase]: 16355/21487 cut-off events. [2024-02-19 14:51:40,684 INFO L125 PetriNetUnfolderBase]: For 106606/107060 co-relation queries the response was YES. [2024-02-19 14:51:40,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330605 conditions, 21487 events. 16355/21487 cut-off events. For 106606/107060 co-relation queries the response was YES. Maximal size of possible extension queue 1027. Compared 117990 event pairs, 9 based on Foata normal form. 157/21641 useless extension candidates. Maximal degree in co-relation 324036. Up to 18171 conditions per place. [2024-02-19 14:51:41,029 INFO L140 encePairwiseOnDemand]: 35/43 looper letters, 1214 selfloop transitions, 50 changer transitions 80/1349 dead transitions. [2024-02-19 14:51:41,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 1349 transitions, 42929 flow [2024-02-19 14:51:41,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-02-19 14:51:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-02-19 14:51:41,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-02-19 14:51:41,030 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5852713178294574 [2024-02-19 14:51:41,030 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 76 predicate places. [2024-02-19 14:51:41,031 INFO L507 AbstractCegarLoop]: Abstraction has has 123 places, 1349 transitions, 42929 flow [2024-02-19 14:51:41,031 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-02-19 14:51:41,031 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:41,031 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:41,031 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-02-19 14:51:41,031 INFO L432 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:41,032 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1031203629, now seen corresponding path program 7 times [2024-02-19 14:51:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:41,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865620253] [2024-02-19 14:51:41,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:41,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:41,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:41,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:41,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865620253] [2024-02-19 14:51:41,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865620253] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-19 14:51:41,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-19 14:51:41,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-02-19 14:51:41,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355402044] [2024-02-19 14:51:41,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-19 14:51:41,107 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-02-19 14:51:41,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:41,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-02-19 14:51:41,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-02-19 14:51:41,112 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 43 [2024-02-19 14:51:41,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 1349 transitions, 42929 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:41,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:41,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 43 [2024-02-19 14:51:41,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-19 14:51:45,196 INFO L124 PetriNetUnfolderBase]: 16023/20982 cut-off events. [2024-02-19 14:51:45,196 INFO L125 PetriNetUnfolderBase]: For 123853/124477 co-relation queries the response was YES. [2024-02-19 14:51:45,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342703 conditions, 20982 events. 16023/20982 cut-off events. For 123853/124477 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 114126 event pairs, 9 based on Foata normal form. 33/21012 useless extension candidates. Maximal degree in co-relation 335982. Up to 17735 conditions per place. [2024-02-19 14:51:45,495 INFO L140 encePairwiseOnDemand]: 36/43 looper letters, 1147 selfloop transitions, 37 changer transitions 86/1301 dead transitions. [2024-02-19 14:51:45,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 1301 transitions, 43930 flow [2024-02-19 14:51:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-19 14:51:45,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-19 14:51:45,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 126 transitions. [2024-02-19 14:51:45,496 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2024-02-19 14:51:45,496 INFO L308 CegarLoopForPetriNet]: 47 programPoint places, 80 predicate places. [2024-02-19 14:51:45,496 INFO L507 AbstractCegarLoop]: Abstraction has has 127 places, 1301 transitions, 43930 flow [2024-02-19 14:51:45,497 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-19 14:51:45,497 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-19 14:51:45,497 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-19 14:51:45,497 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-02-19 14:51:45,497 INFO L432 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-02-19 14:51:45,497 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-19 14:51:45,498 INFO L85 PathProgramCache]: Analyzing trace with hash -722531129, now seen corresponding path program 1 times [2024-02-19 14:51:45,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-19 14:51:45,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904238668] [2024-02-19 14:51:45,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:45,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-19 14:51:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:45,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-19 14:51:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904238668] [2024-02-19 14:51:45,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904238668] provided 0 perfect and 1 imperfect interpolant sequences [2024-02-19 14:51:45,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017672032] [2024-02-19 14:51:45,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-19 14:51:45,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-02-19 14:51:45,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-19 14:51:45,612 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-02-19 14:51:45,614 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-02-19 14:51:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-19 14:51:45,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2024-02-19 14:51:45,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-19 14:51:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:45,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-02-19 14:51:45,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-19 14:51:45,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017672032] provided 0 perfect and 2 imperfect interpolant sequences [2024-02-19 14:51:45,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-02-19 14:51:45,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2024-02-19 14:51:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414083333] [2024-02-19 14:51:45,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-02-19 14:51:45,831 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-02-19 14:51:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-19 14:51:45,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-02-19 14:51:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-02-19 14:51:45,832 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 43 [2024-02-19 14:51:45,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 1301 transitions, 43930 flow. Second operand has 7 states, 7 states have (on average 20.285714285714285) internal successors, (142), 7 states have internal predecessors, (142), 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-02-19 14:51:45,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-19 14:51:45,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 43 [2024-02-19 14:51:45,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand