./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/queue.i -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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:21:46,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:21:46,332 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:21:46,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:21:46,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:21:46,363 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:21:46,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:21:46,364 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:21:46,364 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:21:46,367 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:21:46,368 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:21:46,368 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:21:46,369 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:21:46,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:21:46,370 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:21:46,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:21:46,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:21:46,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:21:46,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:21:46,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:21:46,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:21:46,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:21:46,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:21:46,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:21:46,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:21:46,373 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:21:46,373 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:21:46,373 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:21:46,373 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:21:46,374 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:21:46,374 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:21:46,374 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:21:46,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:21:46,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:21:46,375 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:21:46,375 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:21:46,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:21:46,375 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:21:46,376 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:21:46,376 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:21:46,376 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:21:46,376 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:21:46,376 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:21:46,376 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2024-06-27 17:21:46,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:21:46,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:21:46,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:21:46,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:21:46,642 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:21:46,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue.i [2024-06-27 17:21:47,639 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:21:47,873 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:21:47,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i [2024-06-27 17:21:47,888 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b0e9bc8/44437900ed8a4c188bc1f4c4151aa02d/FLAG46636910d [2024-06-27 17:21:47,899 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2b0e9bc8/44437900ed8a4c188bc1f4c4151aa02d [2024-06-27 17:21:47,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:21:47,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-06-27 17:21:47,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:21:47,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:21:47,908 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:21:47,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:21:47" (1/1) ... [2024-06-27 17:21:47,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321f3baf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:47, skipping insertion in model container [2024-06-27 17:21:47,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:21:47" (1/1) ... [2024-06-27 17:21:47,947 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:21:48,320 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-06-27 17:21:48,329 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-06-27 17:21:48,334 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-06-27 17:21:48,342 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:21:48,353 INFO L202 MainTranslator]: Completed pre-run [2024-06-27 17:21:48,413 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43284,43297] [2024-06-27 17:21:48,417 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43491,43504] [2024-06-27 17:21:48,421 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue.i[43772,43785] [2024-06-27 17:21:48,424 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:21:48,511 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:21:48,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48 WrapperNode [2024-06-27 17:21:48,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:21:48,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:21:48,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:21:48,513 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:21:48,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,564 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,588 INFO L138 Inliner]: procedures = 274, calls = 61, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 248 [2024-06-27 17:21:48,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:21:48,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:21:48,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:21:48,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:21:48,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,610 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,628 INFO L175 MemorySlicer]: Split 51 memory accesses to 5 slices as follows [2, 8, 5, 4, 32]. 63 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 8, 5, 0, 0]. The 18 writes are split as follows [0, 0, 0, 3, 15]. [2024-06-27 17:21:48,629 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,629 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,644 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:21:48,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:21:48,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:21:48,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:21:48,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (1/1) ... [2024-06-27 17:21:48,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:21:48,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:21:48,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-06-27 17:21:48,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-06-27 17:21:48,734 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-06-27 17:21:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-06-27 17:21:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-06-27 17:21:48,735 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-06-27 17:21:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 17:21:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-06-27 17:21:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-06-27 17:21:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-06-27 17:21:48,735 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-06-27 17:21:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-06-27 17:21:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-06-27 17:21:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-06-27 17:21:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-06-27 17:21:48,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-06-27 17:21:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-06-27 17:21:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 17:21:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:21:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:21:48,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:21:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:21:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 17:21:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-06-27 17:21:48,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:21:48,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:21:48,740 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:21:48,869 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:21:48,870 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:21:49,228 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:21:49,228 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:21:49,484 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:21:49,484 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 17:21:49,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:21:49 BoogieIcfgContainer [2024-06-27 17:21:49,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:21:49,486 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:21:49,486 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:21:49,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:21:49,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:21:47" (1/3) ... [2024-06-27 17:21:49,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a95892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:21:49, skipping insertion in model container [2024-06-27 17:21:49,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:21:48" (2/3) ... [2024-06-27 17:21:49,490 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a95892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:21:49, skipping insertion in model container [2024-06-27 17:21:49,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:21:49" (3/3) ... [2024-06-27 17:21:49,492 INFO L112 eAbstractionObserver]: Analyzing ICFG queue.i [2024-06-27 17:21:49,500 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-06-27 17:21:49,508 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:21:49,508 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-06-27 17:21:49,508 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:21:49,568 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-06-27 17:21:49,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 46 places, 46 transitions, 106 flow [2024-06-27 17:21:49,610 INFO L124 PetriNetUnfolderBase]: 7/44 cut-off events. [2024-06-27 17:21:49,610 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-06-27 17:21:49,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 44 events. 7/44 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 82 event pairs, 0 based on Foata normal form. 0/34 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-06-27 17:21:49,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 46 places, 46 transitions, 106 flow [2024-06-27 17:21:49,619 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 42 transitions, 93 flow [2024-06-27 17:21:49,629 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:21:49,634 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b3d8b2d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:21:49,635 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-06-27 17:21:49,637 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:21:49,637 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 17:21:49,638 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:21:49,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:49,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 17:21:49,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:49,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:49,644 INFO L85 PathProgramCache]: Analyzing trace with hash 647013, now seen corresponding path program 1 times [2024-06-27 17:21:49,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:49,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735534723] [2024-06-27 17:21:49,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:49,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:49,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:49,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735534723] [2024-06-27 17:21:49,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735534723] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:49,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:49,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:21:49,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439514529] [2024-06-27 17:21:49,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:49,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-06-27 17:21:49,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:49,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-06-27 17:21:49,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-06-27 17:21:49,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:49,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 42 transitions, 93 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:49,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:49,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:49,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:50,063 INFO L124 PetriNetUnfolderBase]: 428/771 cut-off events. [2024-06-27 17:21:50,063 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-06-27 17:21:50,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1508 conditions, 771 events. 428/771 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3499 event pairs, 334 based on Foata normal form. 47/731 useless extension candidates. Maximal degree in co-relation 1449. Up to 697 conditions per place. [2024-06-27 17:21:50,070 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 30 selfloop transitions, 0 changer transitions 0/37 dead transitions. [2024-06-27 17:21:50,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 143 flow [2024-06-27 17:21:50,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-06-27 17:21:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-06-27 17:21:50,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 53 transitions. [2024-06-27 17:21:50,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5760869565217391 [2024-06-27 17:21:50,082 INFO L175 Difference]: Start difference. First operand has 42 places, 42 transitions, 93 flow. Second operand 2 states and 53 transitions. [2024-06-27 17:21:50,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 143 flow [2024-06-27 17:21:50,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 138 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:21:50,087 INFO L231 Difference]: Finished difference. Result has 38 places, 37 transitions, 78 flow [2024-06-27 17:21:50,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=37} [2024-06-27 17:21:50,092 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -4 predicate places. [2024-06-27 17:21:50,092 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 37 transitions, 78 flow [2024-06-27 17:21:50,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:50,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:50,093 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:21:50,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:21:50,093 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:50,094 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:50,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1703533609, now seen corresponding path program 1 times [2024-06-27 17:21:50,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:50,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832544445] [2024-06-27 17:21:50,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:50,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:50,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:50,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832544445] [2024-06-27 17:21:50,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832544445] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:50,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:50,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:21:50,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075393337] [2024-06-27 17:21:50,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:50,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:21:50,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:50,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:21:50,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:21:50,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:50,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 37 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:50,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:50,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:50,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:50,405 INFO L124 PetriNetUnfolderBase]: 408/749 cut-off events. [2024-06-27 17:21:50,406 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-06-27 17:21:50,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1455 conditions, 749 events. 408/749 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3501 event pairs, 307 based on Foata normal form. 0/686 useless extension candidates. Maximal degree in co-relation 1452. Up to 627 conditions per place. [2024-06-27 17:21:50,413 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 39 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2024-06-27 17:21:50,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 184 flow [2024-06-27 17:21:50,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:21:50,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:21:50,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2024-06-27 17:21:50,416 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5217391304347826 [2024-06-27 17:21:50,416 INFO L175 Difference]: Start difference. First operand has 38 places, 37 transitions, 78 flow. Second operand 3 states and 72 transitions. [2024-06-27 17:21:50,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 184 flow [2024-06-27 17:21:50,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 48 transitions, 184 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:21:50,421 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 80 flow [2024-06-27 17:21:50,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2024-06-27 17:21:50,422 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2024-06-27 17:21:50,423 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 80 flow [2024-06-27 17:21:50,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:50,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:50,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:21:50,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:21:50,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:50,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:50,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1269932666, now seen corresponding path program 1 times [2024-06-27 17:21:50,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:50,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626122086] [2024-06-27 17:21:50,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:50,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:50,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:50,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626122086] [2024-06-27 17:21:50,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626122086] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:50,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:50,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:21:50,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555036248] [2024-06-27 17:21:50,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:50,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-06-27 17:21:50,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:50,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-06-27 17:21:50,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-06-27 17:21:50,814 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:50,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:50,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:50,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:50,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:51,039 INFO L124 PetriNetUnfolderBase]: 674/1238 cut-off events. [2024-06-27 17:21:51,039 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2024-06-27 17:21:51,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2423 conditions, 1238 events. 674/1238 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 6150 event pairs, 74 based on Foata normal form. 0/1177 useless extension candidates. Maximal degree in co-relation 2419. Up to 658 conditions per place. [2024-06-27 17:21:51,045 INFO L140 encePairwiseOnDemand]: 39/46 looper letters, 70 selfloop transitions, 10 changer transitions 3/90 dead transitions. [2024-06-27 17:21:51,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 90 transitions, 367 flow [2024-06-27 17:21:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-06-27 17:21:51,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-06-27 17:21:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-06-27 17:21:51,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5253623188405797 [2024-06-27 17:21:51,047 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 80 flow. Second operand 6 states and 145 transitions. [2024-06-27 17:21:51,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 90 transitions, 367 flow [2024-06-27 17:21:51,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 90 transitions, 357 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:21:51,062 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 144 flow [2024-06-27 17:21:51,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2024-06-27 17:21:51,063 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2024-06-27 17:21:51,063 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 144 flow [2024-06-27 17:21:51,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:51,063 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:51,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:21:51,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:21:51,064 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:51,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:51,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1989387445, now seen corresponding path program 1 times [2024-06-27 17:21:51,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:51,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288365295] [2024-06-27 17:21:51,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:51,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:51,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288365295] [2024-06-27 17:21:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288365295] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:51,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:51,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:21:51,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527346385] [2024-06-27 17:21:51,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:51,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:21:51,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:51,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:21:51,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:21:51,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:51,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:51,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:51,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:51,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:51,206 INFO L124 PetriNetUnfolderBase]: 419/804 cut-off events. [2024-06-27 17:21:51,207 INFO L125 PetriNetUnfolderBase]: For 111/114 co-relation queries the response was YES. [2024-06-27 17:21:51,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 804 events. 419/804 cut-off events. For 111/114 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3522 event pairs, 215 based on Foata normal form. 29/811 useless extension candidates. Maximal degree in co-relation 1662. Up to 416 conditions per place. [2024-06-27 17:21:51,210 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 36 selfloop transitions, 4 changer transitions 3/49 dead transitions. [2024-06-27 17:21:51,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 213 flow [2024-06-27 17:21:51,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:21:51,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:21:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-06-27 17:21:51,211 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5289855072463768 [2024-06-27 17:21:51,212 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 144 flow. Second operand 3 states and 73 transitions. [2024-06-27 17:21:51,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 213 flow [2024-06-27 17:21:51,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 49 transitions, 207 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-06-27 17:21:51,213 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 106 flow [2024-06-27 17:21:51,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2024-06-27 17:21:51,214 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2024-06-27 17:21:51,214 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 106 flow [2024-06-27 17:21:51,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:51,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:51,215 INFO L208 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] [2024-06-27 17:21:51,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:21:51,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:51,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash 969934260, now seen corresponding path program 1 times [2024-06-27 17:21:51,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:51,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76458751] [2024-06-27 17:21:51,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:51,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:51,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:51,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:51,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76458751] [2024-06-27 17:21:51,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76458751] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:51,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:51,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:21:51,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233279754] [2024-06-27 17:21:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:51,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:21:51,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:51,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:21:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:21:51,287 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:51,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:51,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:51,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:51,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:51,360 INFO L124 PetriNetUnfolderBase]: 249/543 cut-off events. [2024-06-27 17:21:51,360 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-06-27 17:21:51,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1129 conditions, 543 events. 249/543 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2146 event pairs, 85 based on Foata normal form. 32/565 useless extension candidates. Maximal degree in co-relation 1121. Up to 252 conditions per place. [2024-06-27 17:21:51,363 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 33 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2024-06-27 17:21:51,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 207 flow [2024-06-27 17:21:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:21:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:21:51,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-06-27 17:21:51,364 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5072463768115942 [2024-06-27 17:21:51,364 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 106 flow. Second operand 3 states and 70 transitions. [2024-06-27 17:21:51,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 207 flow [2024-06-27 17:21:51,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 197 flow, removed 2 selfloop flow, removed 2 redundant places. [2024-06-27 17:21:51,366 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 108 flow [2024-06-27 17:21:51,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2024-06-27 17:21:51,368 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2024-06-27 17:21:51,369 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 108 flow [2024-06-27 17:21:51,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:51,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:51,369 INFO L208 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] [2024-06-27 17:21:51,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:21:51,369 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:51,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:51,370 INFO L85 PathProgramCache]: Analyzing trace with hash 677134911, now seen corresponding path program 1 times [2024-06-27 17:21:51,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:51,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434559772] [2024-06-27 17:21:51,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:51,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:52,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:52,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434559772] [2024-06-27 17:21:52,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434559772] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:52,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:52,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:21:52,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310147651] [2024-06-27 17:21:52,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:52,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:21:52,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:52,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:21:52,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:21:52,429 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:52,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 108 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:52,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:52,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:52,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:52,741 INFO L124 PetriNetUnfolderBase]: 370/808 cut-off events. [2024-06-27 17:21:52,742 INFO L125 PetriNetUnfolderBase]: For 187/187 co-relation queries the response was YES. [2024-06-27 17:21:52,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 808 events. 370/808 cut-off events. For 187/187 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3834 event pairs, 68 based on Foata normal form. 0/795 useless extension candidates. Maximal degree in co-relation 1764. Up to 260 conditions per place. [2024-06-27 17:21:52,745 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 63 selfloop transitions, 16 changer transitions 8/93 dead transitions. [2024-06-27 17:21:52,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 459 flow [2024-06-27 17:21:52,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:21:52,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:21:52,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-06-27 17:21:52,747 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4251207729468599 [2024-06-27 17:21:52,747 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 108 flow. Second operand 9 states and 176 transitions. [2024-06-27 17:21:52,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 459 flow [2024-06-27 17:21:52,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 437 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:21:52,749 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 214 flow [2024-06-27 17:21:52,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=214, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-06-27 17:21:52,750 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2024-06-27 17:21:52,750 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 214 flow [2024-06-27 17:21:52,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:52,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:52,751 INFO L208 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] [2024-06-27 17:21:52,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:21:52,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:52,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:52,752 INFO L85 PathProgramCache]: Analyzing trace with hash -340202185, now seen corresponding path program 2 times [2024-06-27 17:21:52,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:52,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273658589] [2024-06-27 17:21:52,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:52,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:52,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:53,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:53,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273658589] [2024-06-27 17:21:53,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273658589] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:53,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:53,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:21:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583088161] [2024-06-27 17:21:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:21:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:53,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:21:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:21:53,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:53,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 214 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:53,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:53,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:53,747 INFO L124 PetriNetUnfolderBase]: 479/1063 cut-off events. [2024-06-27 17:21:53,748 INFO L125 PetriNetUnfolderBase]: For 857/858 co-relation queries the response was YES. [2024-06-27 17:21:53,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2792 conditions, 1063 events. 479/1063 cut-off events. For 857/858 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5848 event pairs, 131 based on Foata normal form. 0/1041 useless extension candidates. Maximal degree in co-relation 2779. Up to 636 conditions per place. [2024-06-27 17:21:53,752 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 69 selfloop transitions, 15 changer transitions 4/94 dead transitions. [2024-06-27 17:21:53,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 580 flow [2024-06-27 17:21:53,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:21:53,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:21:53,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 166 transitions. [2024-06-27 17:21:53,753 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40096618357487923 [2024-06-27 17:21:53,753 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 214 flow. Second operand 9 states and 166 transitions. [2024-06-27 17:21:53,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 580 flow [2024-06-27 17:21:53,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 94 transitions, 562 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-06-27 17:21:53,760 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 359 flow [2024-06-27 17:21:53,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=359, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-06-27 17:21:53,761 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places. [2024-06-27 17:21:53,761 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 359 flow [2024-06-27 17:21:53,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:53,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:53,761 INFO L208 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] [2024-06-27 17:21:53,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:21:53,762 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:53,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:53,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1004554051, now seen corresponding path program 3 times [2024-06-27 17:21:53,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:53,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038904872] [2024-06-27 17:21:53,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:53,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:54,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:54,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:54,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038904872] [2024-06-27 17:21:54,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038904872] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:54,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:21:54,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932842348] [2024-06-27 17:21:54,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:54,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:21:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:54,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:21:54,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:21:54,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:54,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 359 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:54,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:54,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:54,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:54,846 INFO L124 PetriNetUnfolderBase]: 551/1189 cut-off events. [2024-06-27 17:21:54,847 INFO L125 PetriNetUnfolderBase]: For 1601/1602 co-relation queries the response was YES. [2024-06-27 17:21:54,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3416 conditions, 1189 events. 551/1189 cut-off events. For 1601/1602 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6392 event pairs, 52 based on Foata normal form. 22/1196 useless extension candidates. Maximal degree in co-relation 3397. Up to 322 conditions per place. [2024-06-27 17:21:54,853 INFO L140 encePairwiseOnDemand]: 35/46 looper letters, 90 selfloop transitions, 32 changer transitions 2/130 dead transitions. [2024-06-27 17:21:54,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 130 transitions, 878 flow [2024-06-27 17:21:54,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-06-27 17:21:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-06-27 17:21:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 228 transitions. [2024-06-27 17:21:54,855 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41304347826086957 [2024-06-27 17:21:54,855 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 359 flow. Second operand 12 states and 228 transitions. [2024-06-27 17:21:54,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 130 transitions, 878 flow [2024-06-27 17:21:54,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 130 transitions, 830 flow, removed 24 selfloop flow, removed 0 redundant places. [2024-06-27 17:21:54,865 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 498 flow [2024-06-27 17:21:54,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=498, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2024-06-27 17:21:54,866 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 39 predicate places. [2024-06-27 17:21:54,866 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 498 flow [2024-06-27 17:21:54,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:54,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:54,867 INFO L208 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] [2024-06-27 17:21:54,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:21:54,867 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:54,867 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:54,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1884402519, now seen corresponding path program 4 times [2024-06-27 17:21:54,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:54,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191490131] [2024-06-27 17:21:54,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:54,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:55,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:55,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:55,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191490131] [2024-06-27 17:21:55,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191490131] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:21:55,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:21:55,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-06-27 17:21:55,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525562854] [2024-06-27 17:21:55,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:21:55,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-06-27 17:21:55,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:21:55,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-06-27 17:21:55,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-06-27 17:21:55,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 46 [2024-06-27 17:21:55,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 498 flow. Second operand has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:55,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:21:55,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 46 [2024-06-27 17:21:55,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:21:56,014 INFO L124 PetriNetUnfolderBase]: 625/1367 cut-off events. [2024-06-27 17:21:56,015 INFO L125 PetriNetUnfolderBase]: For 3154/3154 co-relation queries the response was YES. [2024-06-27 17:21:56,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 1367 events. 625/1367 cut-off events. For 3154/3154 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7595 event pairs, 138 based on Foata normal form. 0/1356 useless extension candidates. Maximal degree in co-relation 4361. Up to 681 conditions per place. [2024-06-27 17:21:56,023 INFO L140 encePairwiseOnDemand]: 36/46 looper letters, 89 selfloop transitions, 22 changer transitions 2/119 dead transitions. [2024-06-27 17:21:56,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 119 transitions, 960 flow [2024-06-27 17:21:56,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-06-27 17:21:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-06-27 17:21:56,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 173 transitions. [2024-06-27 17:21:56,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178743961352657 [2024-06-27 17:21:56,025 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 498 flow. Second operand 9 states and 173 transitions. [2024-06-27 17:21:56,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 119 transitions, 960 flow [2024-06-27 17:21:56,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 119 transitions, 884 flow, removed 20 selfloop flow, removed 5 redundant places. [2024-06-27 17:21:56,034 INFO L231 Difference]: Finished difference. Result has 89 places, 81 transitions, 635 flow [2024-06-27 17:21:56,034 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=635, PETRI_PLACES=89, PETRI_TRANSITIONS=81} [2024-06-27 17:21:56,035 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 47 predicate places. [2024-06-27 17:21:56,035 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 81 transitions, 635 flow [2024-06-27 17:21:56,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.11111111111111) internal successors, (109), 9 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:21:56,035 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:21:56,035 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:21:56,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:21:56,036 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:21:56,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:21:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1801865796, now seen corresponding path program 1 times [2024-06-27 17:21:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:21:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728030993] [2024-06-27 17:21:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:21:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:56,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:21:56,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728030993] [2024-06-27 17:21:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728030993] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:21:56,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474714712] [2024-06-27 17:21:56,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:21:56,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:21:56,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:21:56,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:21:56,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-06-27 17:21:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:21:57,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjunts are in the unsatisfiable core [2024-06-27 17:21:57,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:21:57,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:21:57,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2024-06-27 17:21:57,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:21:57,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-06-27 17:21:57,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-06-27 17:21:58,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-06-27 17:21:58,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-06-27 17:21:58,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:21:58,103 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:21:58,397 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:21:58,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:21:58,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:21:58,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:21:59,531 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:21:59,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:21:59,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:21:59,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:00,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:22:00,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:22:00,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:22:00,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:22:00,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-06-27 17:22:00,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-06-27 17:22:00,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-06-27 17:22:00,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-06-27 17:22:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:01,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474714712] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:01,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:01,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:01,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335035128] [2024-06-27 17:22:01,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:01,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:01,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:01,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:01,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:22:01,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-06-27 17:22:01,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 635 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:01,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:01,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-06-27 17:22:01,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:04,823 INFO L124 PetriNetUnfolderBase]: 854/1781 cut-off events. [2024-06-27 17:22:04,823 INFO L125 PetriNetUnfolderBase]: For 4683/4685 co-relation queries the response was YES. [2024-06-27 17:22:04,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5802 conditions, 1781 events. 854/1781 cut-off events. For 4683/4685 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 10193 event pairs, 181 based on Foata normal form. 10/1783 useless extension candidates. Maximal degree in co-relation 5771. Up to 1072 conditions per place. [2024-06-27 17:22:04,833 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 132 selfloop transitions, 40 changer transitions 2/179 dead transitions. [2024-06-27 17:22:04,833 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 179 transitions, 1404 flow [2024-06-27 17:22:04,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:22:04,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:22:04,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 292 transitions. [2024-06-27 17:22:04,835 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3734015345268542 [2024-06-27 17:22:04,835 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 635 flow. Second operand 17 states and 292 transitions. [2024-06-27 17:22:04,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 179 transitions, 1404 flow [2024-06-27 17:22:04,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 179 transitions, 1317 flow, removed 40 selfloop flow, removed 2 redundant places. [2024-06-27 17:22:04,851 INFO L231 Difference]: Finished difference. Result has 110 places, 110 transitions, 889 flow [2024-06-27 17:22:04,852 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=889, PETRI_PLACES=110, PETRI_TRANSITIONS=110} [2024-06-27 17:22:04,852 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 68 predicate places. [2024-06-27 17:22:04,852 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 110 transitions, 889 flow [2024-06-27 17:22:04,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:04,853 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:04,853 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:04,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-06-27 17:22:05,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-06-27 17:22:05,064 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:05,065 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:05,065 INFO L85 PathProgramCache]: Analyzing trace with hash 406995244, now seen corresponding path program 2 times [2024-06-27 17:22:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:05,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255630518] [2024-06-27 17:22:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:05,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:05,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:05,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255630518] [2024-06-27 17:22:05,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255630518] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:05,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742955512] [2024-06-27 17:22:05,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-06-27 17:22:05,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:05,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:05,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:05,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-06-27 17:22:06,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:22:06,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:06,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 50 conjunts are in the unsatisfiable core [2024-06-27 17:22:06,020 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:06,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:22:06,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 98 [2024-06-27 17:22:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:22:06,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 105 [2024-06-27 17:22:06,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 17:22:06,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:06,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 44 [2024-06-27 17:22:06,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:06,626 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:06,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 37 [2024-06-27 17:22:06,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 45 [2024-06-27 17:22:06,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:06,644 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:06,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:06,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:06,960 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:06,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:12,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:12,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:12,883 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:12,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:18,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:18,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:18,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2024-06-27 17:22:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742955512] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:19,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:19,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865569656] [2024-06-27 17:22:19,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:19,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:19,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:19,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:19,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=604, Unknown=2, NotChecked=0, Total=756 [2024-06-27 17:22:23,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:25,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:29,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:29,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2024-06-27 17:22:29,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 110 transitions, 889 flow. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:29,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:29,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2024-06-27 17:22:29,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:32,473 INFO L124 PetriNetUnfolderBase]: 1733/3175 cut-off events. [2024-06-27 17:22:32,473 INFO L125 PetriNetUnfolderBase]: For 10905/10905 co-relation queries the response was YES. [2024-06-27 17:22:32,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11512 conditions, 3175 events. 1733/3175 cut-off events. For 10905/10905 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 17599 event pairs, 150 based on Foata normal form. 18/3184 useless extension candidates. Maximal degree in co-relation 11474. Up to 1331 conditions per place. [2024-06-27 17:22:32,490 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 164 selfloop transitions, 72 changer transitions 4/243 dead transitions. [2024-06-27 17:22:32,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 243 transitions, 2139 flow [2024-06-27 17:22:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:22:32,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:22:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 273 transitions. [2024-06-27 17:22:32,491 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3491048593350384 [2024-06-27 17:22:32,492 INFO L175 Difference]: Start difference. First operand has 110 places, 110 transitions, 889 flow. Second operand 17 states and 273 transitions. [2024-06-27 17:22:32,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 243 transitions, 2139 flow [2024-06-27 17:22:32,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 243 transitions, 2016 flow, removed 52 selfloop flow, removed 4 redundant places. [2024-06-27 17:22:32,522 INFO L231 Difference]: Finished difference. Result has 127 places, 151 transitions, 1417 flow [2024-06-27 17:22:32,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1417, PETRI_PLACES=127, PETRI_TRANSITIONS=151} [2024-06-27 17:22:32,523 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 85 predicate places. [2024-06-27 17:22:32,523 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 151 transitions, 1417 flow [2024-06-27 17:22:32,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:32,523 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:32,523 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:32,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-06-27 17:22:32,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-06-27 17:22:32,730 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:32,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:32,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1175177458, now seen corresponding path program 3 times [2024-06-27 17:22:32,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:32,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150372869] [2024-06-27 17:22:32,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:32,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150372869] [2024-06-27 17:22:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150372869] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:33,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824979228] [2024-06-27 17:22:33,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-06-27 17:22:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:33,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:33,603 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:33,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-06-27 17:22:33,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-06-27 17:22:33,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:33,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2024-06-27 17:22:33,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:33,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:22:33,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2024-06-27 17:22:33,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:22:34,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:34,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2024-06-27 17:22:34,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-06-27 17:22:34,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-06-27 17:22:34,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-06-27 17:22:34,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:34,649 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:34,822 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:34,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:34,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:34,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:39,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:39,765 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:42,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824979228] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:22:42,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:22:42,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:22:42,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279010555] [2024-06-27 17:22:42,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:22:42,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:22:42,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:22:42,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:22:42,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=627, Unknown=1, NotChecked=0, Total=756 [2024-06-27 17:22:46,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:50,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:22:50,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 46 [2024-06-27 17:22:50,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 151 transitions, 1417 flow. Second operand has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:50,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:22:50,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 46 [2024-06-27 17:22:50,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:22:53,931 INFO L124 PetriNetUnfolderBase]: 2146/3884 cut-off events. [2024-06-27 17:22:53,931 INFO L125 PetriNetUnfolderBase]: For 17118/17118 co-relation queries the response was YES. [2024-06-27 17:22:53,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15128 conditions, 3884 events. 2146/3884 cut-off events. For 17118/17118 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 22542 event pairs, 213 based on Foata normal form. 18/3890 useless extension candidates. Maximal degree in co-relation 15084. Up to 1173 conditions per place. [2024-06-27 17:22:53,958 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 200 selfloop transitions, 93 changer transitions 5/301 dead transitions. [2024-06-27 17:22:53,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 301 transitions, 2927 flow [2024-06-27 17:22:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-06-27 17:22:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2024-06-27 17:22:53,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 307 transitions. [2024-06-27 17:22:53,959 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37077294685990336 [2024-06-27 17:22:53,960 INFO L175 Difference]: Start difference. First operand has 127 places, 151 transitions, 1417 flow. Second operand 18 states and 307 transitions. [2024-06-27 17:22:53,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 301 transitions, 2927 flow [2024-06-27 17:22:54,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 301 transitions, 2787 flow, removed 60 selfloop flow, removed 4 redundant places. [2024-06-27 17:22:54,004 INFO L231 Difference]: Finished difference. Result has 147 places, 184 transitions, 1969 flow [2024-06-27 17:22:54,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1969, PETRI_PLACES=147, PETRI_TRANSITIONS=184} [2024-06-27 17:22:54,005 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 105 predicate places. [2024-06-27 17:22:54,005 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 184 transitions, 1969 flow [2024-06-27 17:22:54,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 9.75) internal successors, (273), 28 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:22:54,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:22:54,005 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:22:54,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-06-27 17:22:54,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:54,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:22:54,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:22:54,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1463390868, now seen corresponding path program 4 times [2024-06-27 17:22:54,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:22:54,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420921794] [2024-06-27 17:22:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:22:54,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:22:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:22:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:54,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:22:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420921794] [2024-06-27 17:22:54,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420921794] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:22:54,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857488984] [2024-06-27 17:22:54,901 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-06-27 17:22:54,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:22:54,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:22:54,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:22:54,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-06-27 17:22:55,062 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-06-27 17:22:55,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:22:55,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 43 conjunts are in the unsatisfiable core [2024-06-27 17:22:55,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:22:55,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2024-06-27 17:22:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 165 treesize of output 153 [2024-06-27 17:22:55,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:22:55,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 139 [2024-06-27 17:22:55,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:55,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-06-27 17:22:55,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:55,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2024-06-27 17:22:55,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-06-27 17:22:55,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2024-06-27 17:22:55,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-06-27 17:22:55,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2024-06-27 17:22:55,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2024-06-27 17:22:55,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:22:55,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:22:55,909 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:55,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:22:55,980 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:55,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:58,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:22:58,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:22:58,019 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:22:58,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:23:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:00,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857488984] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:23:00,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:23:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:23:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805304095] [2024-06-27 17:23:00,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:23:00,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:23:00,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:23:00,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:23:00,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:23:04,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-06-27 17:23:04,371 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 46 [2024-06-27 17:23:04,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 184 transitions, 1969 flow. Second operand has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:23:04,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:23:04,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 46 [2024-06-27 17:23:04,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:23:07,313 INFO L124 PetriNetUnfolderBase]: 1418/2885 cut-off events. [2024-06-27 17:23:07,313 INFO L125 PetriNetUnfolderBase]: For 18615/18615 co-relation queries the response was YES. [2024-06-27 17:23:07,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12084 conditions, 2885 events. 1418/2885 cut-off events. For 18615/18615 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 17715 event pairs, 134 based on Foata normal form. 84/2962 useless extension candidates. Maximal degree in co-relation 12032. Up to 787 conditions per place. [2024-06-27 17:23:07,330 INFO L140 encePairwiseOnDemand]: 32/46 looper letters, 141 selfloop transitions, 96 changer transitions 6/247 dead transitions. [2024-06-27 17:23:07,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 247 transitions, 2668 flow [2024-06-27 17:23:07,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-06-27 17:23:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2024-06-27 17:23:07,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 284 transitions. [2024-06-27 17:23:07,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3631713554987212 [2024-06-27 17:23:07,333 INFO L175 Difference]: Start difference. First operand has 147 places, 184 transitions, 1969 flow. Second operand 17 states and 284 transitions. [2024-06-27 17:23:07,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 247 transitions, 2668 flow [2024-06-27 17:23:07,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 247 transitions, 2497 flow, removed 60 selfloop flow, removed 9 redundant places. [2024-06-27 17:23:07,391 INFO L231 Difference]: Finished difference. Result has 151 places, 161 transitions, 1819 flow [2024-06-27 17:23:07,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1477, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1819, PETRI_PLACES=151, PETRI_TRANSITIONS=161} [2024-06-27 17:23:07,391 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 109 predicate places. [2024-06-27 17:23:07,392 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 161 transitions, 1819 flow [2024-06-27 17:23:07,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.535714285714286) internal successors, (295), 28 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:23:07,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:23:07,392 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:23:07,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-06-27 17:23:07,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:07,603 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:23:07,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:23:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -381720562, now seen corresponding path program 5 times [2024-06-27 17:23:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:23:07,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851057407] [2024-06-27 17:23:07,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:23:07,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:23:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:23:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:08,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:23:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851057407] [2024-06-27 17:23:08,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851057407] provided 0 perfect and 1 imperfect interpolant sequences [2024-06-27 17:23:08,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058605933] [2024-06-27 17:23:08,378 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-06-27 17:23:08,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-06-27 17:23:08,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:23:08,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-06-27 17:23:08,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-06-27 17:23:08,536 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-06-27 17:23:08,536 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-06-27 17:23:08,538 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 48 conjunts are in the unsatisfiable core [2024-06-27 17:23:08,543 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-06-27 17:23:08,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-06-27 17:23:08,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 111 [2024-06-27 17:23:08,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2024-06-27 17:23:08,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-06-27 17:23:08,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2024-06-27 17:23:08,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 57 [2024-06-27 17:23:09,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 56 [2024-06-27 17:23:09,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2024-06-27 17:23:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:09,295 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-06-27 17:23:09,482 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-06-27 17:23:09,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2024-06-27 17:23:09,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-06-27 17:23:09,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 22 [2024-06-27 17:23:11,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:23:11,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:23:11,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-06-27 17:23:11,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2024-06-27 17:23:11,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-06-27 17:23:11,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2024-06-27 17:23:11,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-06-27 17:23:11,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 102 [2024-06-27 17:23:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:23:12,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058605933] provided 0 perfect and 2 imperfect interpolant sequences [2024-06-27 17:23:12,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-06-27 17:23:12,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2024-06-27 17:23:12,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537947292] [2024-06-27 17:23:12,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-06-27 17:23:12,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-06-27 17:23:12,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:23:12,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-06-27 17:23:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2024-06-27 17:23:13,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 46 [2024-06-27 17:23:13,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 161 transitions, 1819 flow. Second operand has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:23:13,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:23:13,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 46 [2024-06-27 17:23:13,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:23:16,148 INFO L124 PetriNetUnfolderBase]: 1085/2359 cut-off events. [2024-06-27 17:23:16,148 INFO L125 PetriNetUnfolderBase]: For 15244/15244 co-relation queries the response was YES. [2024-06-27 17:23:16,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10400 conditions, 2359 events. 1085/2359 cut-off events. For 15244/15244 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 14965 event pairs, 177 based on Foata normal form. 6/2354 useless extension candidates. Maximal degree in co-relation 10347. Up to 1367 conditions per place. [2024-06-27 17:23:16,161 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 177 selfloop transitions, 42 changer transitions 2/226 dead transitions. [2024-06-27 17:23:16,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 226 transitions, 2656 flow [2024-06-27 17:23:16,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-06-27 17:23:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-06-27 17:23:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 232 transitions. [2024-06-27 17:23:16,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3879598662207358 [2024-06-27 17:23:16,170 INFO L175 Difference]: Start difference. First operand has 151 places, 161 transitions, 1819 flow. Second operand 13 states and 232 transitions. [2024-06-27 17:23:16,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 226 transitions, 2656 flow [2024-06-27 17:23:16,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 226 transitions, 2472 flow, removed 23 selfloop flow, removed 14 redundant places. [2024-06-27 17:23:16,209 INFO L231 Difference]: Finished difference. Result has 153 places, 173 transitions, 1944 flow [2024-06-27 17:23:16,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=1653, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1944, PETRI_PLACES=153, PETRI_TRANSITIONS=173} [2024-06-27 17:23:16,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 111 predicate places. [2024-06-27 17:23:16,210 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 173 transitions, 1944 flow [2024-06-27 17:23:16,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 11.428571428571429) internal successors, (320), 28 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:23:16,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:23:16,211 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:23:16,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-06-27 17:23:16,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-06-27 17:23:16,423 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-06-27 17:23:16,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:23:16,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1340773053, now seen corresponding path program 1 times [2024-06-27 17:23:16,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:23:16,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966873166] [2024-06-27 17:23:16,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:23:16,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:23:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:23:16,457 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-06-27 17:23:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-06-27 17:23:16,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-06-27 17:23:16,509 INFO L360 BasicCegarLoop]: Counterexample is feasible [2024-06-27 17:23:16,511 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2024-06-27 17:23:16,512 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-06-27 17:23:16,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-06-27 17:23:16,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-06-27 17:23:16,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-06-27 17:23:16,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-06-27 17:23:16,513 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-06-27 17:23:16,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-06-27 17:23:16,514 INFO L445 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1] [2024-06-27 17:23:16,519 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:23:16,519 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:23:16,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:23:16 BasicIcfg [2024-06-27 17:23:16,558 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:23:16,558 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-06-27 17:23:16,558 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-06-27 17:23:16,558 INFO L274 PluginConnector]: Witness Printer initialized [2024-06-27 17:23:16,559 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:21:49" (3/4) ... [2024-06-27 17:23:16,559 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2024-06-27 17:23:16,618 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-06-27 17:23:16,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-06-27 17:23:16,619 INFO L158 Benchmark]: Toolchain (without parser) took 88716.84ms. Allocated memory was 174.1MB in the beginning and 792.7MB in the end (delta: 618.7MB). Free memory was 122.2MB in the beginning and 400.3MB in the end (delta: -278.1MB). Peak memory consumption was 340.5MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,619 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:23:16,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.57ms. Allocated memory is still 174.1MB. Free memory was 121.6MB in the beginning and 134.3MB in the end (delta: -12.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.60ms. Allocated memory is still 174.1MB. Free memory was 134.3MB in the beginning and 130.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,620 INFO L158 Benchmark]: Boogie Preprocessor took 58.01ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,620 INFO L158 Benchmark]: RCFGBuilder took 837.48ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 129.2MB in the end (delta: -1.7MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,624 INFO L158 Benchmark]: TraceAbstraction took 87071.84ms. Allocated memory was 174.1MB in the beginning and 792.7MB in the end (delta: 618.7MB). Free memory was 129.2MB in the beginning and 410.8MB in the end (delta: -281.6MB). Peak memory consumption was 336.0MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,625 INFO L158 Benchmark]: Witness Printer took 60.76ms. Allocated memory is still 792.7MB. Free memory was 410.8MB in the beginning and 400.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-06-27 17:23:16,625 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory was 63.0MB in the beginning and 62.9MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.57ms. Allocated memory is still 174.1MB. Free memory was 121.6MB in the beginning and 134.3MB in the end (delta: -12.7MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.60ms. Allocated memory is still 174.1MB. Free memory was 134.3MB in the beginning and 130.6MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.01ms. Allocated memory is still 174.1MB. Free memory was 130.6MB in the beginning and 127.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 837.48ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 129.2MB in the end (delta: -1.7MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * TraceAbstraction took 87071.84ms. Allocated memory was 174.1MB in the beginning and 792.7MB in the end (delta: 618.7MB). Free memory was 129.2MB in the beginning and 410.8MB in the end (delta: -281.6MB). Peak memory consumption was 336.0MB. Max. memory is 16.1GB. * Witness Printer took 60.76ms. Allocated memory is still 792.7MB. Free memory was 410.8MB in the beginning and 400.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1043]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L947] 0 pthread_mutex_t m; [L949] 0 int stored_elements[(20)]; [L949] 0 int stored_elements[(20)]; [L950] 0 _Bool enqueue_flag, dequeue_flag; [L951] 0 QType queue; [L951] 0 QType queue; [L1054] 0 pthread_t id1, id2; [L1055] 0 enqueue_flag=(1) [L1056] 0 dequeue_flag=(0) [L1057] CALL 0 init(&queue) [L954] 0 q->head=0 [L955] 0 q->tail=0 [L956] 0 q->amount=0 [L1057] RET 0 init(&queue) [L1058] CALL, EXPR 0 empty(&queue) [L960] EXPR 0 q->head [L960] EXPR 0 q->tail [L960] COND TRUE 0 q->head == q->tail [L963] 0 return (-1); [L1058] RET, EXPR 0 empty(&queue) [L1058] COND FALSE 0 !(!empty(&queue)==(-1)) [L1063] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1007] 1 int value, i; VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1064] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, &queue) VAL [dequeue_flag=0, enqueue_flag=1, id1=-2, id2=-1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1036] 2 int i; [L1037] 2 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1009] 1 value = __VERIFIER_nondet_int() [L1010] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1010] RET 1 enqueue(&queue,value) [L1010] COND FALSE 1 !(enqueue(&queue,value)) [L1013] 1 stored_elements[0]=value [L1014] CALL 1 empty(&queue) [L960] EXPR 1 q->head [L960] EXPR 1 q->tail [L960] COND FALSE 1 !(q->head == q->tail) [L966] 1 return 0; [L1014] RET 1 empty(&queue) [L1037] COND TRUE 2 i<(20) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1014] COND FALSE 1 !(empty(&queue)) [L1040] COND FALSE 2 !(\read(dequeue_flag)) VAL [dequeue_flag=0, enqueue_flag=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] 2 i++ VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1037] COND TRUE 2 i<(20) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1018] 1 i=0 VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1018] COND TRUE 1 i<((20)-1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=0, enqueue_flag=1, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=0] [L1021] COND TRUE 1 \read(enqueue_flag) [L1023] 1 value = __VERIFIER_nondet_int() [L1024] CALL 1 enqueue(&queue,value) [L980] EXPR 1 q->tail [L980] 1 q->element[q->tail] = x [L981] EXPR 1 q->amount [L981] 1 q->amount++ [L981] 1 q->amount++ [L982] EXPR 1 q->tail [L982] COND FALSE 1 !(q->tail == (20)) [L988] EXPR 1 q->tail [L988] 1 q->tail++ [L988] 1 q->tail++ [L990] 1 return 0; [L1024] RET 1 enqueue(&queue,value) [L1025] 1 stored_elements[i+1]=value [L1026] 1 enqueue_flag=(0) [L1027] 1 dequeue_flag=(1) VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=0, m={3:0}, queue={5:0}, stored_elements={4:0}, value=1] [L1040] COND TRUE 2 \read(dequeue_flag) [L1042] CALL, EXPR 2 dequeue(&queue) [L994] 2 int x; [L995] EXPR 2 q->head [L995] EXPR 2 q->element[q->head] [L995] 2 x = q->element[q->head] [L996] EXPR 2 q->amount [L996] 2 q->amount-- [L996] 2 q->amount-- [L997] EXPR 2 q->head [L997] COND FALSE 2 !(q->head == (20)) [L1002] EXPR 2 q->head [L1002] 2 q->head++ [L1002] 2 q->head++ [L1003] 2 return x; [L1042] RET, EXPR 2 dequeue(&queue) [L1042] EXPR 2 stored_elements[i] VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] [L1042] COND TRUE 2 !dequeue(&queue)==stored_elements[i] [L1043] 2 reach_error() VAL [\old(arg)={5:0}, arg={5:0}, dequeue_flag=1, enqueue_flag=0, i=1, m={3:0}, queue={5:0}, stored_elements={4:0}] - UnprovableResult [Line: 1059]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 86.9s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 41.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 1398 SdHoareTripleChecker+Valid, 36.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1362 mSDsluCounter, 986 SdHoareTripleChecker+Invalid, 35.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 943 mSDsCounter, 116 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8094 IncrementalHoareTripleChecker+Invalid, 8215 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 116 mSolverCounterUnsat, 43 mSDtfsCounter, 8094 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 196 SyntacticMatches, 6 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1915 ImplicationChecksByTransitivity, 22.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=12, InterpolantAutomatonStates: 138, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 42.1s InterpolantComputationTime, 455 NumberOfCodeBlocks, 455 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 542 ConstructedInterpolants, 111 QuantifiedInterpolants, 89087 SizeOfPredicates, 190 NumberOfNonLiveVariables, 1350 ConjunctsInSsa, 231 ConjunctsInUnsatCore, 24 InterpolantComputations, 9 PerfectInterpolantSequences, 0/60 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-06-27 17:23:16,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE