./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 08:25:01,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 08:25:01,650 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 08:25:01,655 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 08:25:01,656 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 08:25:01,689 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 08:25:01,690 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 08:25:01,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 08:25:01,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 08:25:01,693 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 08:25:01,694 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 08:25:01,694 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 08:25:01,694 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 08:25:01,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 08:25:01,697 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 08:25:01,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 08:25:01,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 08:25:01,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 08:25:01,698 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 08:25:01,698 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 08:25:01,698 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 08:25:01,699 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 08:25:01,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 08:25:01,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 08:25:01,701 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 08:25:01,702 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 08:25:01,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 08:25:01,702 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 08:25:01,703 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 08:25:01,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 08:25:01,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 08:25:01,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 08:25:01,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:25:01,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 08:25:01,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 08:25:01,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 08:25:01,705 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 08:25:01,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 08:25:01,705 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 08:25:01,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 08:25:01,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 08:25:01,706 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 08:25:01,706 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 -> ceb2af5016fd0ad74653237fbc44a2b3541e4ff971325e3807dab6f19c05af6d [2024-11-12 08:25:02,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 08:25:02,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 08:25:02,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 08:25:02,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 08:25:02,036 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 08:25:02,038 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-12 08:25:03,516 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 08:25:03,780 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 08:25:03,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c [2024-11-12 08:25:03,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500fbb832/fd5f62b7ad8c4b309631121aa25db628/FLAG1e2702ff6 [2024-11-12 08:25:03,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/500fbb832/fd5f62b7ad8c4b309631121aa25db628 [2024-11-12 08:25:03,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 08:25:03,810 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 08:25:03,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 08:25:03,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 08:25:03,819 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 08:25:03,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:25:03" (1/1) ... [2024-11-12 08:25:03,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bdadd17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:03, skipping insertion in model container [2024-11-12 08:25:03,820 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:25:03" (1/1) ... [2024-11-12 08:25:03,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 08:25:04,108 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2024-11-12 08:25:04,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:25:04,138 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 08:25:04,163 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-horseshoe.wvr.c[3463,3476] [2024-11-12 08:25:04,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:25:04,182 INFO L204 MainTranslator]: Completed translation [2024-11-12 08:25:04,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04 WrapperNode [2024-11-12 08:25:04,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 08:25:04,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 08:25:04,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 08:25:04,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 08:25:04,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,203 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,230 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 239 [2024-11-12 08:25:04,231 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 08:25:04,231 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 08:25:04,231 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 08:25:04,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 08:25:04,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,266 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-12 08:25:04,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 08:25:04,296 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 08:25:04,296 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 08:25:04,296 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 08:25:04,297 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (1/1) ... [2024-11-12 08:25:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:25:04,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:04,344 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-11-12 08:25:04,352 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-11-12 08:25:04,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 08:25:04,401 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 08:25:04,401 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 08:25:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 08:25:04,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 08:25:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-12 08:25:04,402 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-12 08:25:04,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 08:25:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 08:25:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 08:25:04,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 08:25:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 08:25:04,407 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-12 08:25:04,554 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 08:25:04,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 08:25:04,956 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 08:25:04,956 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 08:25:05,331 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 08:25:05,332 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-12 08:25:05,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:25:05 BoogieIcfgContainer [2024-11-12 08:25:05,333 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 08:25:05,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 08:25:05,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 08:25:05,340 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 08:25:05,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:25:03" (1/3) ... [2024-11-12 08:25:05,341 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f8a1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:25:05, skipping insertion in model container [2024-11-12 08:25:05,341 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:25:04" (2/3) ... [2024-11-12 08:25:05,343 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21f8a1c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:25:05, skipping insertion in model container [2024-11-12 08:25:05,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:25:05" (3/3) ... [2024-11-12 08:25:05,344 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2024-11-12 08:25:05,365 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 08:25:05,365 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 08:25:05,365 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 08:25:05,431 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-12 08:25:05,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 44 transitions, 109 flow [2024-11-12 08:25:05,516 INFO L124 PetriNetUnfolderBase]: 7/41 cut-off events. [2024-11-12 08:25:05,517 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 08:25:05,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54 conditions, 41 events. 7/41 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 33. Up to 2 conditions per place. [2024-11-12 08:25:05,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 44 transitions, 109 flow [2024-11-12 08:25:05,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 40 transitions, 98 flow [2024-11-12 08:25:05,537 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 08:25:05,544 INFO L333 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, 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;@31da790, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 08:25:05,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 08:25:05,558 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 08:25:05,559 INFO L124 PetriNetUnfolderBase]: 7/39 cut-off events. [2024-11-12 08:25:05,559 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-12 08:25:05,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:05,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:05,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:05,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:05,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1497833839, now seen corresponding path program 1 times [2024-11-12 08:25:05,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:05,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530900291] [2024-11-12 08:25:05,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:05,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:05,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:05,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530900291] [2024-11-12 08:25:05,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530900291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:05,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:25:05,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 08:25:05,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922806436] [2024-11-12 08:25:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:05,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 08:25:05,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:05,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 08:25:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 08:25:05,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:05,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 98 flow. Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-12 08:25:05,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:05,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:05,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:06,301 INFO L124 PetriNetUnfolderBase]: 727/1249 cut-off events. [2024-11-12 08:25:06,302 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2024-11-12 08:25:06,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1249 events. 727/1249 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6233 event pairs, 595 based on Foata normal form. 130/1232 useless extension candidates. Maximal degree in co-relation 2178. Up to 991 conditions per place. [2024-11-12 08:25:06,343 INFO L140 encePairwiseOnDemand]: 42/44 looper letters, 28 selfloop transitions, 0 changer transitions 0/38 dead transitions. [2024-11-12 08:25:06,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 150 flow [2024-11-12 08:25:06,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 08:25:06,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-12 08:25:06,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 56 transitions. [2024-11-12 08:25:06,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-12 08:25:06,371 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 98 flow. Second operand 2 states and 56 transitions. [2024-11-12 08:25:06,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 150 flow [2024-11-12 08:25:06,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 138 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-12 08:25:06,380 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 82 flow [2024-11-12 08:25:06,382 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=82, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2024-11-12 08:25:06,386 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -5 predicate places. [2024-11-12 08:25:06,386 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 82 flow [2024-11-12 08:25:06,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 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-11-12 08:25:06,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:06,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:06,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 08:25:06,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:06,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:06,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1767931675, now seen corresponding path program 1 times [2024-11-12 08:25:06,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:06,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272771634] [2024-11-12 08:25:06,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:06,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:06,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:06,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272771634] [2024-11-12 08:25:06,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272771634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:06,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:25:06,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 08:25:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206339534] [2024-11-12 08:25:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:06,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 08:25:06,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 08:25:06,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 08:25:06,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:06,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:25:06,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:06,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:06,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:06,813 INFO L124 PetriNetUnfolderBase]: 733/1234 cut-off events. [2024-11-12 08:25:06,814 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-12 08:25:06,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1234 events. 733/1234 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5933 event pairs, 189 based on Foata normal form. 27/1182 useless extension candidates. Maximal degree in co-relation 2306. Up to 875 conditions per place. [2024-11-12 08:25:06,825 INFO L140 encePairwiseOnDemand]: 40/44 looper letters, 37 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2024-11-12 08:25:06,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 50 transitions, 188 flow [2024-11-12 08:25:06,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 08:25:06,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 08:25:06,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-12 08:25:06,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-12 08:25:06,829 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 82 flow. Second operand 3 states and 80 transitions. [2024-11-12 08:25:06,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 50 transitions, 188 flow [2024-11-12 08:25:06,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 188 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 08:25:06,832 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 101 flow [2024-11-12 08:25:06,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2024-11-12 08:25:06,833 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2024-11-12 08:25:06,833 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 101 flow [2024-11-12 08:25:06,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:25:06,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:06,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:06,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 08:25:06,834 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:06,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:06,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1846619617, now seen corresponding path program 2 times [2024-11-12 08:25:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:06,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519684261] [2024-11-12 08:25:06,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:06,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519684261] [2024-11-12 08:25:06,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519684261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:06,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:25:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 08:25:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368685203] [2024-11-12 08:25:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:06,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 08:25:06,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:06,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 08:25:06,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 08:25:06,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:06,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:25:06,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:06,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:06,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:07,119 INFO L124 PetriNetUnfolderBase]: 663/1213 cut-off events. [2024-11-12 08:25:07,119 INFO L125 PetriNetUnfolderBase]: For 203/205 co-relation queries the response was YES. [2024-11-12 08:25:07,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2455 conditions, 1213 events. 663/1213 cut-off events. For 203/205 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5983 event pairs, 248 based on Foata normal form. 26/1147 useless extension candidates. Maximal degree in co-relation 2450. Up to 555 conditions per place. [2024-11-12 08:25:07,126 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 40 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-11-12 08:25:07,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 52 transitions, 217 flow [2024-11-12 08:25:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 08:25:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 08:25:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-12 08:25:07,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2024-11-12 08:25:07,128 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 101 flow. Second operand 3 states and 80 transitions. [2024-11-12 08:25:07,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 52 transitions, 217 flow [2024-11-12 08:25:07,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 08:25:07,129 INFO L231 Difference]: Finished difference. Result has 43 places, 41 transitions, 110 flow [2024-11-12 08:25:07,130 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=41} [2024-11-12 08:25:07,133 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2024-11-12 08:25:07,133 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 41 transitions, 110 flow [2024-11-12 08:25:07,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:25:07,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:07,133 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:07,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 08:25:07,134 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:07,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:07,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1902711549, now seen corresponding path program 3 times [2024-11-12 08:25:07,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:07,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662176651] [2024-11-12 08:25:07,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:07,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:07,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:07,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:07,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662176651] [2024-11-12 08:25:07,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662176651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:25:07,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 08:25:07,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348146227] [2024-11-12 08:25:07,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:07,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:25:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:25:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:25:07,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:07,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 41 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:25:07,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:07,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:07,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:07,543 INFO L124 PetriNetUnfolderBase]: 712/1311 cut-off events. [2024-11-12 08:25:07,543 INFO L125 PetriNetUnfolderBase]: For 284/286 co-relation queries the response was YES. [2024-11-12 08:25:07,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2784 conditions, 1311 events. 712/1311 cut-off events. For 284/286 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 6460 event pairs, 521 based on Foata normal form. 27/1244 useless extension candidates. Maximal degree in co-relation 2778. Up to 950 conditions per place. [2024-11-12 08:25:07,553 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 30 selfloop transitions, 2 changer transitions 15/57 dead transitions. [2024-11-12 08:25:07,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 239 flow [2024-11-12 08:25:07,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:25:07,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:25:07,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-12 08:25:07,556 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5045454545454545 [2024-11-12 08:25:07,558 INFO L175 Difference]: Start difference. First operand has 43 places, 41 transitions, 110 flow. Second operand 5 states and 111 transitions. [2024-11-12 08:25:07,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 239 flow [2024-11-12 08:25:07,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 57 transitions, 237 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 08:25:07,560 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 128 flow [2024-11-12 08:25:07,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-12 08:25:07,561 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 6 predicate places. [2024-11-12 08:25:07,561 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 128 flow [2024-11-12 08:25:07,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:25:07,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:07,561 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:07,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 08:25:07,562 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:07,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1465505519, now seen corresponding path program 1 times [2024-11-12 08:25:07,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:07,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438379432] [2024-11-12 08:25:07,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:07,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:07,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:07,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438379432] [2024-11-12 08:25:07,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438379432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:07,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:25:07,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:25:07,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366493384] [2024-11-12 08:25:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:07,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:25:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:25:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:25:07,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:07,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 128 flow. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-12 08:25:07,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:07,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:07,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:07,937 INFO L124 PetriNetUnfolderBase]: 905/1634 cut-off events. [2024-11-12 08:25:07,937 INFO L125 PetriNetUnfolderBase]: For 471/475 co-relation queries the response was YES. [2024-11-12 08:25:07,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3561 conditions, 1634 events. 905/1634 cut-off events. For 471/475 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8428 event pairs, 676 based on Foata normal form. 32/1572 useless extension candidates. Maximal degree in co-relation 3552. Up to 948 conditions per place. [2024-11-12 08:25:07,947 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 29 selfloop transitions, 4 changer transitions 19/62 dead transitions. [2024-11-12 08:25:07,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 294 flow [2024-11-12 08:25:07,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:25:07,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:25:07,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-12 08:25:07,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5136363636363637 [2024-11-12 08:25:07,951 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 128 flow. Second operand 5 states and 113 transitions. [2024-11-12 08:25:07,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 294 flow [2024-11-12 08:25:07,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 274 flow, removed 9 selfloop flow, removed 3 redundant places. [2024-11-12 08:25:07,954 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 136 flow [2024-11-12 08:25:07,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2024-11-12 08:25:07,955 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 7 predicate places. [2024-11-12 08:25:07,956 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 136 flow [2024-11-12 08:25:07,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-11-12 08:25:07,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:07,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:07,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 08:25:07,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:07,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:07,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2091232520, now seen corresponding path program 1 times [2024-11-12 08:25:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:07,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455960282] [2024-11-12 08:25:07,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:07,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:08,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:09,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455960282] [2024-11-12 08:25:09,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455960282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:09,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101797554] [2024-11-12 08:25:09,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:09,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:09,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:09,955 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-11-12 08:25:09,966 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-11-12 08:25:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:10,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 08:25:10,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:10,281 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 23 treesize of output 1 [2024-11-12 08:25:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:10,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:25:11,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 08:25:11,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 194 treesize of output 188 [2024-11-12 08:25:11,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 08:25:11,928 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 31 [2024-11-12 08:25:12,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 08:25:12,018 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 125 [2024-11-12 08:25:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:12,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101797554] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:25:12,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:25:12,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 35 [2024-11-12 08:25:12,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786656836] [2024-11-12 08:25:12,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:25:12,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 08:25:12,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:12,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 08:25:12,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1149, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 08:25:12,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2024-11-12 08:25:12,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 136 flow. Second operand has 36 states, 36 states have (on average 9.38888888888889) internal successors, (338), 36 states have internal predecessors, (338), 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-11-12 08:25:12,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:12,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2024-11-12 08:25:12,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:19,138 INFO L124 PetriNetUnfolderBase]: 4005/6304 cut-off events. [2024-11-12 08:25:19,139 INFO L125 PetriNetUnfolderBase]: For 1326/1330 co-relation queries the response was YES. [2024-11-12 08:25:19,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13845 conditions, 6304 events. 4005/6304 cut-off events. For 1326/1330 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 34270 event pairs, 199 based on Foata normal form. 4/5915 useless extension candidates. Maximal degree in co-relation 13836. Up to 1679 conditions per place. [2024-11-12 08:25:19,178 INFO L140 encePairwiseOnDemand]: 28/44 looper letters, 330 selfloop transitions, 97 changer transitions 4/435 dead transitions. [2024-11-12 08:25:19,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 435 transitions, 2022 flow [2024-11-12 08:25:19,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-12 08:25:19,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2024-11-12 08:25:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 755 transitions. [2024-11-12 08:25:19,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3730237154150198 [2024-11-12 08:25:19,183 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 136 flow. Second operand 46 states and 755 transitions. [2024-11-12 08:25:19,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 435 transitions, 2022 flow [2024-11-12 08:25:19,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 435 transitions, 2004 flow, removed 5 selfloop flow, removed 3 redundant places. [2024-11-12 08:25:19,195 INFO L231 Difference]: Finished difference. Result has 102 places, 140 transitions, 751 flow [2024-11-12 08:25:19,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=751, PETRI_PLACES=102, PETRI_TRANSITIONS=140} [2024-11-12 08:25:19,197 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 59 predicate places. [2024-11-12 08:25:19,198 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 140 transitions, 751 flow [2024-11-12 08:25:19,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 9.38888888888889) internal successors, (338), 36 states have internal predecessors, (338), 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-11-12 08:25:19,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:19,199 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:19,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 08:25:19,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-12 08:25:19,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:19,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:19,405 INFO L85 PathProgramCache]: Analyzing trace with hash 188674062, now seen corresponding path program 2 times [2024-11-12 08:25:19,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:19,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195661116] [2024-11-12 08:25:19,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195661116] [2024-11-12 08:25:20,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195661116] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:20,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420150975] [2024-11-12 08:25:20,911 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 08:25:20,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:20,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:20,913 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-11-12 08:25:20,915 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-11-12 08:25:21,011 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 08:25:21,012 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:25:21,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-12 08:25:21,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:21,386 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 08:25:21,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 08:25:21,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420150975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:21,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 08:25:21,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [14] total 21 [2024-11-12 08:25:21,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226016854] [2024-11-12 08:25:21,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:21,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 08:25:21,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:21,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 08:25:21,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-12 08:25:21,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-12 08:25:21,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 140 transitions, 751 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-11-12 08:25:21,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:21,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-12 08:25:21,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:22,218 INFO L124 PetriNetUnfolderBase]: 3354/5668 cut-off events. [2024-11-12 08:25:22,218 INFO L125 PetriNetUnfolderBase]: For 6592/6596 co-relation queries the response was YES. [2024-11-12 08:25:22,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15831 conditions, 5668 events. 3354/5668 cut-off events. For 6592/6596 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 33907 event pairs, 881 based on Foata normal form. 96/5747 useless extension candidates. Maximal degree in co-relation 15813. Up to 3392 conditions per place. [2024-11-12 08:25:22,262 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 130 selfloop transitions, 31 changer transitions 2/171 dead transitions. [2024-11-12 08:25:22,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 171 transitions, 1117 flow [2024-11-12 08:25:22,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 08:25:22,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-12 08:25:22,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 163 transitions. [2024-11-12 08:25:22,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4630681818181818 [2024-11-12 08:25:22,264 INFO L175 Difference]: Start difference. First operand has 102 places, 140 transitions, 751 flow. Second operand 8 states and 163 transitions. [2024-11-12 08:25:22,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 171 transitions, 1117 flow [2024-11-12 08:25:22,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 171 transitions, 1005 flow, removed 45 selfloop flow, removed 6 redundant places. [2024-11-12 08:25:22,312 INFO L231 Difference]: Finished difference. Result has 100 places, 120 transitions, 679 flow [2024-11-12 08:25:22,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=679, PETRI_PLACES=100, PETRI_TRANSITIONS=120} [2024-11-12 08:25:22,313 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 57 predicate places. [2024-11-12 08:25:22,313 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 120 transitions, 679 flow [2024-11-12 08:25:22,315 INFO L472 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-11-12 08:25:22,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:22,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:22,334 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 08:25:22,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-12 08:25:22,520 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:22,521 INFO L85 PathProgramCache]: Analyzing trace with hash -295622918, now seen corresponding path program 1 times [2024-11-12 08:25:22,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:22,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190287500] [2024-11-12 08:25:22,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:22,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:22,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190287500] [2024-11-12 08:25:22,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190287500] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161266896] [2024-11-12 08:25:22,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:22,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:22,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:22,659 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-11-12 08:25:22,664 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-11-12 08:25:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:22,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 08:25:22,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:22,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:22,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:25:22,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:22,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161266896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:25:22,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:25:22,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-12 08:25:22,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947063775] [2024-11-12 08:25:22,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:25:22,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 08:25:22,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:22,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 08:25:22,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 08:25:22,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:22,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 120 transitions, 679 flow. Second operand has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 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-11-12 08:25:22,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:22,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:22,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:23,531 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([712] L88-->L92: Formula: (and (not (= (ite (and (< v_~q2_front~0_81 v_~q2_back~0_90) (< v_~q2_front~0_81 v_~n2~0_56) (<= 0 v_~q2_front~0_81)) 1 0) 0)) (= (select (select |v_#memory_int#1_82| v_~q2~0.base_79) (+ v_~q2~0.offset_79 (* 4 v_~q2_front~0_81))) |v_thread3Thread1of1ForFork1_~k~0#1_3|) (= (+ v_~q2_front~0_81 1) v_~q2_front~0_80)) InVars {~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, ~q2_front~0=v_~q2_front~0_81, ~q2~0.base=v_~q2~0.base_79, #memory_int#1=|v_#memory_int#1_82|, ~q2_back~0=v_~q2_back~0_90} OutVars{thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_1|, thread3Thread1of1ForFork1_#t~mem10#1=|v_thread3Thread1of1ForFork1_#t~mem10#1_1|, ~n2~0=v_~n2~0_56, ~q2~0.offset=v_~q2~0.offset_79, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1_1|, thread3Thread1of1ForFork1_#t~post11#1=|v_thread3Thread1of1ForFork1_#t~post11#1_1|, ~q2_front~0=v_~q2_front~0_80, ~q2~0.base=v_~q2~0.base_79, thread3Thread1of1ForFork1_~k~0#1=|v_thread3Thread1of1ForFork1_~k~0#1_3|, #memory_int#1=|v_#memory_int#1_82|, ~q2_back~0=v_~q2_back~0_90} AuxVars[] AssignedVars[thread3Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread3Thread1of1ForFork1_#t~mem10#1, thread3Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread3Thread1of1ForFork1_#t~post11#1, ~q2_front~0, thread3Thread1of1ForFork1_~k~0#1][109], [Black: 62#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0)), 50#true, 498#true, Black: 308#(and (<= ~n2~0 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 1) (= ~t~0 0) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~1#1| ~n1~0) (+ |ULTIMATE.start_create_fresh_int_array_~size#1| 1)) (= ~q1_back~0 ~q1_front~0) (= ~q2_back~0 ~q2_front~0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= ~s~0 0) (= |ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset| 0)), Black: 455#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 336#(and (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (= (+ (* 2 ~t~0) (* 2 |thread3Thread1of1ForFork1_~k~0#1|) 2) ~s~0)), Black: 463#(and (= (+ |thread3Thread1of1ForFork1_~k~0#1| 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0)), Black: 338#(and (= (+ ~t~0 1) 0) (= ~s~0 0) (not (= |thread3Thread1of1ForFork1_~k~0#1| 0))), 10#L122-1true, Black: 467#(and (= (+ ~t~0 1) 0) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~s~0 0)), Black: 459#(and (exists ((~q1~0.offset Int) (v_~q1_front~0_101 Int) (~q1~0.base Int)) (= (select (select |#memory_int#1| ~q1~0.base) (+ (* v_~q1_front~0_101 4) ~q1~0.offset)) 0)) (= |thread2Thread1of1ForFork0_~j~0#1| 0) (= ~t~0 0) (= ~s~0 0) (= (+ (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 1) 0)), 34#L65-2true, Black: 320#(and (or (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0)))), Black: 439#(and (= (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4))) 0) (= ~t~0 0) (= ~q2_back~0 ~q2_front~0) (= ~s~0 0)), Black: 328#(and (exists ((v_~q1_front~0_100 Int) (v_subst_9 Int) (v_subst_10 Int)) (= (select (select |#memory_int#1| v_subst_10) (+ (* v_~q1_front~0_100 4) v_subst_9)) 0)) (or (= (+ (* 2 (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 1) (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~s~0)) (< 0 (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)) (< (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int#1| ~q1~0.base) (+ ~q1~0.offset (* ~q1_front~0 4)))) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0)) (<= 0 |thread2Thread1of1ForFork0_~j~0#1|) (= ~t~0 0) (= 0 ~q2_front~0) (= |thread2Thread1of1ForFork0_~j~0#1| (+ (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset) 1)) (= |thread2Thread1of1ForFork0_~j~0#1| ~s~0) (or (forall ((v_subst_8 Int) (v_subst_7 Int)) (or (< (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1) (select (select |#memory_int#1| v_subst_8) (+ (* ~q1_front~0 4) v_subst_7))) (not (= (select (select |#memory_int#1| v_subst_8) (+ (* ~q1_back~0 4) v_subst_7)) 0)))) (= (+ (* 2 (select (select |#memory_int#1| ~q2~0.base) ~q2~0.offset)) 1) (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) ~s~0)) (< 0 (+ (select (select |#memory_int#1| ~q2~0.base) (+ ~q2~0.offset (* ~q2_back~0 4))) 1)) (< ~n2~0 (+ ~q2_back~0 1)) (< ~q2_back~0 0))), 27#L92true, Black: 91#(= (+ (* 2 ~t~0) 2) ~s~0), Black: 234#(or (< 0 |thread2Thread1of1ForFork0_~j~0#1|) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0)), Black: 340#(and (or (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) (+ |thread2Thread1of1ForFork0_~j~0#1| ~s~0)) (< 0 |thread2Thread1of1ForFork0_~j~0#1|)) (or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))) (or (< 0 |thread2Thread1of1ForFork0_~j~0#1|) (= (+ (* 2 ~t~0) 2 (* (select (select |#memory_int#1| ~q2~0.base) (+ (* 4 ~q2_front~0) ~q2~0.offset)) 2)) ~s~0))), Black: 54#(<= ~q1_back~0 ~q1_front~0), 301#(or (and (= 0 ~q2_front~0) (= ~q1_back~0 ~q1_front~0) (= (* 2 ~t~0) ~s~0)) (not (= ~q2_back~0 0))), 375#true]) [2024-11-12 08:25:23,531 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-12 08:25:23,532 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-12 08:25:23,532 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-12 08:25:23,532 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-12 08:25:23,562 INFO L124 PetriNetUnfolderBase]: 3488/6915 cut-off events. [2024-11-12 08:25:23,562 INFO L125 PetriNetUnfolderBase]: For 10395/10458 co-relation queries the response was YES. [2024-11-12 08:25:23,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18551 conditions, 6915 events. 3488/6915 cut-off events. For 10395/10458 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 52579 event pairs, 1949 based on Foata normal form. 282/7047 useless extension candidates. Maximal degree in co-relation 18530. Up to 2907 conditions per place. [2024-11-12 08:25:23,686 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 113 selfloop transitions, 8 changer transitions 9/171 dead transitions. [2024-11-12 08:25:23,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 171 transitions, 1170 flow [2024-11-12 08:25:23,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 08:25:23,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-12 08:25:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 157 transitions. [2024-11-12 08:25:23,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5097402597402597 [2024-11-12 08:25:23,689 INFO L175 Difference]: Start difference. First operand has 100 places, 120 transitions, 679 flow. Second operand 7 states and 157 transitions. [2024-11-12 08:25:23,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 171 transitions, 1170 flow [2024-11-12 08:25:23,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 171 transitions, 1148 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-11-12 08:25:23,829 INFO L231 Difference]: Finished difference. Result has 107 places, 121 transitions, 720 flow [2024-11-12 08:25:23,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=720, PETRI_PLACES=107, PETRI_TRANSITIONS=121} [2024-11-12 08:25:23,830 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 64 predicate places. [2024-11-12 08:25:23,831 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 121 transitions, 720 flow [2024-11-12 08:25:23,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 16.5) internal successors, (198), 12 states have internal predecessors, (198), 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-11-12 08:25:23,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:23,831 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:23,846 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-11-12 08:25:24,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:24,033 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:24,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:24,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1105036102, now seen corresponding path program 2 times [2024-11-12 08:25:24,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:24,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449317158] [2024-11-12 08:25:24,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:24,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:24,430 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:24,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449317158] [2024-11-12 08:25:24,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449317158] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:24,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929590538] [2024-11-12 08:25:24,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 08:25:24,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:24,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:24,433 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-11-12 08:25:24,435 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-11-12 08:25:24,534 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 08:25:24,534 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:25:24,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 08:25:24,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 08:25:24,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 08:25:24,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929590538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:24,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 08:25:24,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-12 08:25:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471279174] [2024-11-12 08:25:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:24,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:25:24,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:24,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:25:24,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-12 08:25:24,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 44 [2024-11-12 08:25:24,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 121 transitions, 720 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-11-12 08:25:24,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:24,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 44 [2024-11-12 08:25:24,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:25,304 INFO L124 PetriNetUnfolderBase]: 3207/6191 cut-off events. [2024-11-12 08:25:25,305 INFO L125 PetriNetUnfolderBase]: For 9194/9245 co-relation queries the response was YES. [2024-11-12 08:25:25,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17422 conditions, 6191 events. 3207/6191 cut-off events. For 9194/9245 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 43958 event pairs, 909 based on Foata normal form. 103/6180 useless extension candidates. Maximal degree in co-relation 17398. Up to 3409 conditions per place. [2024-11-12 08:25:25,347 INFO L140 encePairwiseOnDemand]: 39/44 looper letters, 110 selfloop transitions, 12 changer transitions 0/157 dead transitions. [2024-11-12 08:25:25,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 157 transitions, 1102 flow [2024-11-12 08:25:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:25:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:25:25,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 128 transitions. [2024-11-12 08:25:25,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5818181818181818 [2024-11-12 08:25:25,349 INFO L175 Difference]: Start difference. First operand has 107 places, 121 transitions, 720 flow. Second operand 5 states and 128 transitions. [2024-11-12 08:25:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 157 transitions, 1102 flow [2024-11-12 08:25:25,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 157 transitions, 1047 flow, removed 22 selfloop flow, removed 5 redundant places. [2024-11-12 08:25:25,419 INFO L231 Difference]: Finished difference. Result has 106 places, 119 transitions, 711 flow [2024-11-12 08:25:25,421 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=711, PETRI_PLACES=106, PETRI_TRANSITIONS=119} [2024-11-12 08:25:25,422 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-11-12 08:25:25,422 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 119 transitions, 711 flow [2024-11-12 08:25:25,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 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-11-12 08:25:25,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:25,424 INFO L206 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:25,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 08:25:25,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:25,625 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:25,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1596590656, now seen corresponding path program 1 times [2024-11-12 08:25:25,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:25,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572402642] [2024-11-12 08:25:25,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:25,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:25,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:25,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572402642] [2024-11-12 08:25:25,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572402642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:25,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965142116] [2024-11-12 08:25:25,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:25,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:25,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:25,771 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-11-12 08:25:25,774 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-11-12 08:25:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:25,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 08:25:25,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:25,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 08:25:25,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 08:25:25,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965142116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:25,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 08:25:25,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2024-11-12 08:25:25,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184071327] [2024-11-12 08:25:25,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:25,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:25:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:25:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-12 08:25:25,943 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:25,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 119 transitions, 711 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-11-12 08:25:25,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:25,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:25,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:26,625 INFO L124 PetriNetUnfolderBase]: 3144/6351 cut-off events. [2024-11-12 08:25:26,626 INFO L125 PetriNetUnfolderBase]: For 9631/9738 co-relation queries the response was YES. [2024-11-12 08:25:26,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18172 conditions, 6351 events. 3144/6351 cut-off events. For 9631/9738 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 46337 event pairs, 1103 based on Foata normal form. 221/6526 useless extension candidates. Maximal degree in co-relation 18149. Up to 2388 conditions per place. [2024-11-12 08:25:26,671 INFO L140 encePairwiseOnDemand]: 41/44 looper letters, 94 selfloop transitions, 11 changer transitions 37/160 dead transitions. [2024-11-12 08:25:26,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 160 transitions, 1136 flow [2024-11-12 08:25:26,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:25:26,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:25:26,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-11-12 08:25:26,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2024-11-12 08:25:26,673 INFO L175 Difference]: Start difference. First operand has 106 places, 119 transitions, 711 flow. Second operand 4 states and 116 transitions. [2024-11-12 08:25:26,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 160 transitions, 1136 flow [2024-11-12 08:25:26,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 160 transitions, 1108 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-12 08:25:26,892 INFO L231 Difference]: Finished difference. Result has 106 places, 80 transitions, 451 flow [2024-11-12 08:25:26,893 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=451, PETRI_PLACES=106, PETRI_TRANSITIONS=80} [2024-11-12 08:25:26,895 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 63 predicate places. [2024-11-12 08:25:26,895 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 80 transitions, 451 flow [2024-11-12 08:25:26,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-11-12 08:25:26,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:26,896 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:26,915 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-11-12 08:25:27,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-12 08:25:27,097 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:27,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:27,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1247273977, now seen corresponding path program 1 times [2024-11-12 08:25:27,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:27,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584479335] [2024-11-12 08:25:27,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:27,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:27,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 08:25:27,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584479335] [2024-11-12 08:25:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584479335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146883400] [2024-11-12 08:25:27,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:27,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:27,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:27,254 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 08:25:27,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-12 08:25:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:27,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 08:25:27,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:27,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 08:25:27,448 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:25:27,615 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 08:25:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146883400] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:25:27,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:25:27,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-12 08:25:27,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872526831] [2024-11-12 08:25:27,618 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:25:27,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 08:25:27,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:27,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 08:25:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-12 08:25:27,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 44 [2024-11-12 08:25:27,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 80 transitions, 451 flow. Second operand has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 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-11-12 08:25:27,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:27,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 44 [2024-11-12 08:25:27,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:28,336 INFO L124 PetriNetUnfolderBase]: 3032/5966 cut-off events. [2024-11-12 08:25:28,336 INFO L125 PetriNetUnfolderBase]: For 12624/12789 co-relation queries the response was YES. [2024-11-12 08:25:28,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18312 conditions, 5966 events. 3032/5966 cut-off events. For 12624/12789 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 42543 event pairs, 1498 based on Foata normal form. 153/6105 useless extension candidates. Maximal degree in co-relation 18288. Up to 2913 conditions per place. [2024-11-12 08:25:28,376 INFO L140 encePairwiseOnDemand]: 38/44 looper letters, 54 selfloop transitions, 6 changer transitions 45/123 dead transitions. [2024-11-12 08:25:28,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 883 flow [2024-11-12 08:25:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 08:25:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-12 08:25:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 181 transitions. [2024-11-12 08:25:28,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45707070707070707 [2024-11-12 08:25:28,378 INFO L175 Difference]: Start difference. First operand has 106 places, 80 transitions, 451 flow. Second operand 9 states and 181 transitions. [2024-11-12 08:25:28,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 883 flow [2024-11-12 08:25:28,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 123 transitions, 830 flow, removed 19 selfloop flow, removed 12 redundant places. [2024-11-12 08:25:28,463 INFO L231 Difference]: Finished difference. Result has 77 places, 78 transitions, 418 flow [2024-11-12 08:25:28,463 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=418, PETRI_PLACES=77, PETRI_TRANSITIONS=78} [2024-11-12 08:25:28,464 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 34 predicate places. [2024-11-12 08:25:28,464 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 78 transitions, 418 flow [2024-11-12 08:25:28,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 17.0) internal successors, (204), 12 states have internal predecessors, (204), 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-11-12 08:25:28,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:28,465 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:28,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-12 08:25:28,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:28,670 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:28,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:28,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2116933794, now seen corresponding path program 2 times [2024-11-12 08:25:28,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:28,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057598026] [2024-11-12 08:25:28,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:28,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:28,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057598026] [2024-11-12 08:25:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057598026] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085781463] [2024-11-12 08:25:30,246 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 08:25:30,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:30,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:30,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 08:25:30,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-12 08:25:30,370 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 08:25:30,370 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:25:30,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-12 08:25:30,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:31,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 08:25:31,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 08:25:31,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085781463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:25:31,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 08:25:31,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 29 [2024-11-12 08:25:31,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613782658] [2024-11-12 08:25:31,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:25:31,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-12 08:25:31,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:31,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-12 08:25:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=792, Unknown=0, NotChecked=0, Total=870 [2024-11-12 08:25:31,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 44 [2024-11-12 08:25:31,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 78 transitions, 418 flow. Second operand has 15 states, 15 states have (on average 9.4) internal successors, (141), 15 states have internal predecessors, (141), 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-11-12 08:25:31,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:31,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 44 [2024-11-12 08:25:31,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:25:32,354 INFO L124 PetriNetUnfolderBase]: 5565/8615 cut-off events. [2024-11-12 08:25:32,354 INFO L125 PetriNetUnfolderBase]: For 13755/13755 co-relation queries the response was YES. [2024-11-12 08:25:32,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25884 conditions, 8615 events. 5565/8615 cut-off events. For 13755/13755 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 47341 event pairs, 1668 based on Foata normal form. 14/8328 useless extension candidates. Maximal degree in co-relation 25867. Up to 7076 conditions per place. [2024-11-12 08:25:32,413 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 157 selfloop transitions, 29 changer transitions 1/191 dead transitions. [2024-11-12 08:25:32,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 191 transitions, 1273 flow [2024-11-12 08:25:32,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 08:25:32,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-12 08:25:32,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 225 transitions. [2024-11-12 08:25:32,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39335664335664333 [2024-11-12 08:25:32,415 INFO L175 Difference]: Start difference. First operand has 77 places, 78 transitions, 418 flow. Second operand 13 states and 225 transitions. [2024-11-12 08:25:32,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 191 transitions, 1273 flow [2024-11-12 08:25:32,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 191 transitions, 1239 flow, removed 10 selfloop flow, removed 9 redundant places. [2024-11-12 08:25:32,454 INFO L231 Difference]: Finished difference. Result has 86 places, 104 transitions, 726 flow [2024-11-12 08:25:32,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=726, PETRI_PLACES=86, PETRI_TRANSITIONS=104} [2024-11-12 08:25:32,455 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 43 predicate places. [2024-11-12 08:25:32,455 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 104 transitions, 726 flow [2024-11-12 08:25:32,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.4) internal successors, (141), 15 states have internal predecessors, (141), 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-11-12 08:25:32,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:25:32,456 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:25:32,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 08:25:32,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:32,657 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:25:32,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:25:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 743271068, now seen corresponding path program 3 times [2024-11-12 08:25:32,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:25:32,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360123750] [2024-11-12 08:25:32,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:25:32,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:25:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:25:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:25:33,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:25:33,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360123750] [2024-11-12 08:25:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360123750] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:25:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516671105] [2024-11-12 08:25:33,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 08:25:33,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:25:33,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:25:33,986 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 08:25:33,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-12 08:25:34,091 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 08:25:34,091 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:25:34,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-12 08:25:34,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:25:34,588 INFO L349 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2024-11-12 08:25:34,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 34 [2024-11-12 08:25:34,602 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:25:34,602 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:25:35,044 INFO L349 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2024-11-12 08:25:35,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 101 [2024-11-12 08:25:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 08:25:35,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516671105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:25:35,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:25:35,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 11] total 35 [2024-11-12 08:25:35,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528239639] [2024-11-12 08:25:35,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:25:35,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-12 08:25:35,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:25:35,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-12 08:25:35,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 08:25:35,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 44 [2024-11-12 08:25:35,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 104 transitions, 726 flow. Second operand has 36 states, 36 states have (on average 11.61111111111111) internal successors, (418), 36 states have internal predecessors, (418), 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-11-12 08:25:35,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:25:35,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 44 [2024-11-12 08:25:35,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:26:23,115 INFO L124 PetriNetUnfolderBase]: 23066/37397 cut-off events. [2024-11-12 08:26:23,115 INFO L125 PetriNetUnfolderBase]: For 106370/106430 co-relation queries the response was YES. [2024-11-12 08:26:23,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126059 conditions, 37397 events. 23066/37397 cut-off events. For 106370/106430 co-relation queries the response was YES. Maximal size of possible extension queue 1174. Compared 282559 event pairs, 577 based on Foata normal form. 748/38141 useless extension candidates. Maximal degree in co-relation 126036. Up to 6371 conditions per place. [2024-11-12 08:26:23,332 INFO L140 encePairwiseOnDemand]: 31/44 looper letters, 576 selfloop transitions, 253 changer transitions 0/847 dead transitions. [2024-11-12 08:26:23,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 847 transitions, 6724 flow [2024-11-12 08:26:23,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2024-11-12 08:26:23,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2024-11-12 08:26:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 1094 transitions. [2024-11-12 08:26:23,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4691252144082333 [2024-11-12 08:26:23,337 INFO L175 Difference]: Start difference. First operand has 86 places, 104 transitions, 726 flow. Second operand 53 states and 1094 transitions. [2024-11-12 08:26:23,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 847 transitions, 6724 flow [2024-11-12 08:26:23,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 847 transitions, 6652 flow, removed 34 selfloop flow, removed 1 redundant places. [2024-11-12 08:26:23,653 INFO L231 Difference]: Finished difference. Result has 160 places, 362 transitions, 3917 flow [2024-11-12 08:26:23,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=3917, PETRI_PLACES=160, PETRI_TRANSITIONS=362} [2024-11-12 08:26:23,654 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 117 predicate places. [2024-11-12 08:26:23,654 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 362 transitions, 3917 flow [2024-11-12 08:26:23,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 11.61111111111111) internal successors, (418), 36 states have internal predecessors, (418), 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-11-12 08:26:23,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:26:23,655 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:26:23,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-12 08:26:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-12 08:26:23,860 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-12 08:26:23,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:26:23,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2066497444, now seen corresponding path program 4 times [2024-11-12 08:26:23,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:26:23,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970558185] [2024-11-12 08:26:23,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:26:23,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:26:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:26:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:26:25,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:26:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970558185] [2024-11-12 08:26:25,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970558185] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:26:25,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063370882] [2024-11-12 08:26:25,139 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 08:26:25,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:26:25,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:26:25,141 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 08:26:25,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-12 08:26:25,235 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 08:26:25,235 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:26:25,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-12 08:26:25,242 INFO L279 TraceCheckSpWp]: Computing forward predicates...