./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-2.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/parallel-misc-2.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 c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 08:22:36,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 08:22:36,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 08:22:36,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 08:22:36,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 08:22:36,707 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 08:22:36,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 08:22:36,708 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 08:22:36,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 08:22:36,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 08:22:36,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 08:22:36,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 08:22:36,709 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 08:22:36,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 08:22:36,711 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 08:22:36,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 08:22:36,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 08:22:36,712 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 08:22:36,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 08:22:36,713 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 08:22:36,714 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 08:22:36,714 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 08:22:36,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 08:22:36,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 08:22:36,715 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 08:22:36,715 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 08:22:36,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 08:22:36,717 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 08:22:36,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 08:22:36,718 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 08:22:36,718 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 08:22:36,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 08:22:36,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:22:36,718 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 08:22:36,719 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 08:22:36,719 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 08:22:36,719 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 08:22:36,719 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 08:22:36,719 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 08:22:36,720 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 08:22:36,720 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 08:22:36,720 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 08:22:36,721 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 -> c558e00c0dd9b5f4cf40cba6e03e276a996696c71c282947f4c8d13390dc25bf [2024-11-12 08:22:36,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 08:22:36,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 08:22:36,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 08:22:36,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 08:22:36,950 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 08:22:36,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-12 08:22:38,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 08:22:38,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 08:22:38,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-2.wvr.c [2024-11-12 08:22:38,450 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b3c2c7b/b3c3d2a7d59c4523b948beddb870604d/FLAG39bbb6e14 [2024-11-12 08:22:38,468 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44b3c2c7b/b3c3d2a7d59c4523b948beddb870604d [2024-11-12 08:22:38,470 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 08:22:38,472 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 08:22:38,473 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 08:22:38,473 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 08:22:38,478 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 08:22:38,479 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,480 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582d9369 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38, skipping insertion in model container [2024-11-12 08:22:38,480 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,498 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 08:22:38,682 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/parallel-misc-2.wvr.c[2249,2262] [2024-11-12 08:22:38,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:22:38,695 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 08:22:38,714 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/parallel-misc-2.wvr.c[2249,2262] [2024-11-12 08:22:38,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 08:22:38,728 INFO L204 MainTranslator]: Completed translation [2024-11-12 08:22:38,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38 WrapperNode [2024-11-12 08:22:38,728 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 08:22:38,732 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 08:22:38,732 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 08:22:38,732 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 08:22:38,738 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:22:38" (1/1) ... [2024-11-12 08:22:38,743 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:22:38" (1/1) ... [2024-11-12 08:22:38,755 INFO L138 Inliner]: procedures = 18, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2024-11-12 08:22:38,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 08:22:38,756 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 08:22:38,757 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 08:22:38,757 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 08:22:38,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,770 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,779 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 08:22:38,780 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,780 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,787 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 08:22:38,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 08:22:38,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 08:22:38,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 08:22:38,789 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (1/1) ... [2024-11-12 08:22:38,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 08:22:38,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:38,824 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:22:38,831 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:22:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 08:22:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-12 08:22:38,861 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-12 08:22:38,861 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-12 08:22:38,862 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-12 08:22:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 08:22:38,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 08:22:38,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 08:22:38,864 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:22:38,961 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 08:22:38,963 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 08:22:39,111 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-12 08:22:39,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 08:22:39,242 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 08:22:39,243 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 08:22:39,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:22:39 BoogieIcfgContainer [2024-11-12 08:22:39,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 08:22:39,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 08:22:39,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 08:22:39,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 08:22:39,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:22:38" (1/3) ... [2024-11-12 08:22:39,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507c2184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:22:39, skipping insertion in model container [2024-11-12 08:22:39,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:22:38" (2/3) ... [2024-11-12 08:22:39,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@507c2184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:22:39, skipping insertion in model container [2024-11-12 08:22:39,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:22:39" (3/3) ... [2024-11-12 08:22:39,251 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-2.wvr.c [2024-11-12 08:22:39,265 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 08:22:39,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 08:22:39,265 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-12 08:22:39,352 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-12 08:22:39,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 78 flow [2024-11-12 08:22:39,459 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-12 08:22:39,459 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 08:22:39,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 4/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 55 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2024-11-12 08:22:39,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 78 flow [2024-11-12 08:22:39,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 29 transitions, 70 flow [2024-11-12 08:22:39,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 08:22:39,483 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;@59d7a448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 08:22:39,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-12 08:22:39,493 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-12 08:22:39,497 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2024-11-12 08:22:39,497 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-12 08:22:39,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:39,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:39,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1272295163, now seen corresponding path program 1 times [2024-11-12 08:22:39,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:39,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385426011] [2024-11-12 08:22:39,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:39,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:39,853 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:22:39,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:39,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385426011] [2024-11-12 08:22:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385426011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 08:22:39,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598076325] [2024-11-12 08:22:39,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:39,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 08:22:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:39,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 08:22:39,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 08:22:39,906 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:39,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:22:39,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:39,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:39,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:40,017 INFO L124 PetriNetUnfolderBase]: 146/286 cut-off events. [2024-11-12 08:22:40,017 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-12 08:22:40,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 286 events. 146/286 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1137 event pairs, 12 based on Foata normal form. 1/254 useless extension candidates. Maximal degree in co-relation 458. Up to 186 conditions per place. [2024-11-12 08:22:40,023 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 21 selfloop transitions, 7 changer transitions 1/40 dead transitions. [2024-11-12 08:22:40,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 40 transitions, 159 flow [2024-11-12 08:22:40,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 08:22:40,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-12 08:22:40,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2024-11-12 08:22:40,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-12 08:22:40,035 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 70 flow. Second operand 3 states and 69 transitions. [2024-11-12 08:22:40,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 40 transitions, 159 flow [2024-11-12 08:22:40,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 40 transitions, 145 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-12 08:22:40,040 INFO L231 Difference]: Finished difference. Result has 31 places, 33 transitions, 101 flow [2024-11-12 08:22:40,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=31, PETRI_TRANSITIONS=33} [2024-11-12 08:22:40,048 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2024-11-12 08:22:40,048 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 33 transitions, 101 flow [2024-11-12 08:22:40,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 08:22:40,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:40,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:40,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 08:22:40,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:40,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:40,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2086242437, now seen corresponding path program 1 times [2024-11-12 08:22:40,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:40,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023396414] [2024-11-12 08:22:40,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:40,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:40,181 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:22:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:40,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023396414] [2024-11-12 08:22:40,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023396414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:40,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:40,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234551416] [2024-11-12 08:22:40,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:40,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:40,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:40,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:40,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:40,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 33 transitions, 101 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:22:40,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:40,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:40,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:40,328 INFO L124 PetriNetUnfolderBase]: 191/376 cut-off events. [2024-11-12 08:22:40,328 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-12 08:22:40,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 376 events. 191/376 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1753 event pairs, 20 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 276. Up to 143 conditions per place. [2024-11-12 08:22:40,332 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 36 selfloop transitions, 10 changer transitions 5/65 dead transitions. [2024-11-12 08:22:40,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 65 transitions, 290 flow [2024-11-12 08:22:40,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:40,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:40,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2024-11-12 08:22:40,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7375 [2024-11-12 08:22:40,334 INFO L175 Difference]: Start difference. First operand has 31 places, 33 transitions, 101 flow. Second operand 5 states and 118 transitions. [2024-11-12 08:22:40,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 65 transitions, 290 flow [2024-11-12 08:22:40,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 65 transitions, 281 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:40,336 INFO L231 Difference]: Finished difference. Result has 37 places, 40 transitions, 155 flow [2024-11-12 08:22:40,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=155, PETRI_PLACES=37, PETRI_TRANSITIONS=40} [2024-11-12 08:22:40,337 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2024-11-12 08:22:40,337 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 40 transitions, 155 flow [2024-11-12 08:22:40,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:22:40,337 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:40,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:40,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 08:22:40,338 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:40,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:40,338 INFO L85 PathProgramCache]: Analyzing trace with hash 414343881, now seen corresponding path program 2 times [2024-11-12 08:22:40,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:40,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633459154] [2024-11-12 08:22:40,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:40,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:40,479 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:22:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633459154] [2024-11-12 08:22:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633459154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615690535] [2024-11-12 08:22:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:40,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:40,486 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:40,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 40 transitions, 155 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:22:40,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:40,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:40,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:40,626 INFO L124 PetriNetUnfolderBase]: 185/391 cut-off events. [2024-11-12 08:22:40,627 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2024-11-12 08:22:40,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 959 conditions, 391 events. 185/391 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1863 event pairs, 12 based on Foata normal form. 8/367 useless extension candidates. Maximal degree in co-relation 345. Up to 88 conditions per place. [2024-11-12 08:22:40,630 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 12 changer transitions 4/65 dead transitions. [2024-11-12 08:22:40,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 348 flow [2024-11-12 08:22:40,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:40,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2024-11-12 08:22:40,632 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-12 08:22:40,632 INFO L175 Difference]: Start difference. First operand has 37 places, 40 transitions, 155 flow. Second operand 5 states and 115 transitions. [2024-11-12 08:22:40,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 348 flow [2024-11-12 08:22:40,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 65 transitions, 348 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:40,635 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 241 flow [2024-11-12 08:22:40,636 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2024-11-12 08:22:40,636 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 13 predicate places. [2024-11-12 08:22:40,637 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 241 flow [2024-11-12 08:22:40,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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:22:40,637 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:40,637 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] [2024-11-12 08:22:40,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 08:22:40,637 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:40,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:40,638 INFO L85 PathProgramCache]: Analyzing trace with hash -844618454, now seen corresponding path program 1 times [2024-11-12 08:22:40,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630400895] [2024-11-12 08:22:40,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:40,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:40,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630400895] [2024-11-12 08:22:40,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630400895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:40,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:40,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:40,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364571850] [2024-11-12 08:22:40,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:40,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:40,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:40,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:40,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:40,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:40,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:22:40,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:40,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:40,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:40,893 INFO L124 PetriNetUnfolderBase]: 182/379 cut-off events. [2024-11-12 08:22:40,893 INFO L125 PetriNetUnfolderBase]: For 588/588 co-relation queries the response was YES. [2024-11-12 08:22:40,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 379 events. 182/379 cut-off events. For 588/588 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1837 event pairs, 17 based on Foata normal form. 2/347 useless extension candidates. Maximal degree in co-relation 572. Up to 163 conditions per place. [2024-11-12 08:22:40,897 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 41 selfloop transitions, 9 changer transitions 2/66 dead transitions. [2024-11-12 08:22:40,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 66 transitions, 436 flow [2024-11-12 08:22:40,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2024-11-12 08:22:40,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7 [2024-11-12 08:22:40,900 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 241 flow. Second operand 5 states and 112 transitions. [2024-11-12 08:22:40,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 66 transitions, 436 flow [2024-11-12 08:22:40,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 432 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:40,908 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 292 flow [2024-11-12 08:22:40,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=292, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2024-11-12 08:22:40,910 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2024-11-12 08:22:40,910 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 292 flow [2024-11-12 08:22:40,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:22:40,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:40,911 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] [2024-11-12 08:22:40,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 08:22:40,911 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:40,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:40,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1900226788, now seen corresponding path program 2 times [2024-11-12 08:22:40,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:40,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888721203] [2024-11-12 08:22:40,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:40,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:40,983 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:22:40,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:40,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888721203] [2024-11-12 08:22:40,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888721203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:40,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:40,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:40,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229962730] [2024-11-12 08:22:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:40,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:40,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:40,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:40,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:40,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 292 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:22:40,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:40,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:40,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:41,080 INFO L124 PetriNetUnfolderBase]: 168/379 cut-off events. [2024-11-12 08:22:41,081 INFO L125 PetriNetUnfolderBase]: For 793/793 co-relation queries the response was YES. [2024-11-12 08:22:41,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 379 events. 168/379 cut-off events. For 793/793 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1730 event pairs, 6 based on Foata normal form. 17/361 useless extension candidates. Maximal degree in co-relation 751. Up to 99 conditions per place. [2024-11-12 08:22:41,084 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 43 selfloop transitions, 12 changer transitions 1/70 dead transitions. [2024-11-12 08:22:41,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 512 flow [2024-11-12 08:22:41,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:41,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:41,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-12 08:22:41,085 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-11-12 08:22:41,086 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 292 flow. Second operand 5 states and 113 transitions. [2024-11-12 08:22:41,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 512 flow [2024-11-12 08:22:41,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 496 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:41,090 INFO L231 Difference]: Finished difference. Result has 57 places, 51 transitions, 355 flow [2024-11-12 08:22:41,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=57, PETRI_TRANSITIONS=51} [2024-11-12 08:22:41,092 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 25 predicate places. [2024-11-12 08:22:41,093 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 51 transitions, 355 flow [2024-11-12 08:22:41,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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:22:41,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:41,094 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:22:41,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-12 08:22:41,094 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:41,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:41,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1926277624, now seen corresponding path program 1 times [2024-11-12 08:22:41,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:41,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595431145] [2024-11-12 08:22:41,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:41,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:41,323 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:22:41,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595431145] [2024-11-12 08:22:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595431145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 08:22:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862079010] [2024-11-12 08:22:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:22:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:22:41,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:22:41,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 32 [2024-11-12 08:22:41,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 51 transitions, 355 flow. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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:22:41,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:41,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 32 [2024-11-12 08:22:41,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:41,497 INFO L124 PetriNetUnfolderBase]: 251/511 cut-off events. [2024-11-12 08:22:41,497 INFO L125 PetriNetUnfolderBase]: For 1446/1494 co-relation queries the response was YES. [2024-11-12 08:22:41,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1794 conditions, 511 events. 251/511 cut-off events. For 1446/1494 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2365 event pairs, 14 based on Foata normal form. 20/470 useless extension candidates. Maximal degree in co-relation 712. Up to 163 conditions per place. [2024-11-12 08:22:41,502 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 47 selfloop transitions, 23 changer transitions 0/84 dead transitions. [2024-11-12 08:22:41,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 84 transitions, 694 flow [2024-11-12 08:22:41,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:22:41,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:22:41,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2024-11-12 08:22:41,503 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2024-11-12 08:22:41,503 INFO L175 Difference]: Start difference. First operand has 57 places, 51 transitions, 355 flow. Second operand 6 states and 123 transitions. [2024-11-12 08:22:41,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 84 transitions, 694 flow [2024-11-12 08:22:41,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 84 transitions, 679 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:41,508 INFO L231 Difference]: Finished difference. Result has 63 places, 59 transitions, 490 flow [2024-11-12 08:22:41,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=490, PETRI_PLACES=63, PETRI_TRANSITIONS=59} [2024-11-12 08:22:41,509 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 31 predicate places. [2024-11-12 08:22:41,509 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 59 transitions, 490 flow [2024-11-12 08:22:41,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 6 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:22:41,510 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:41,510 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:22:41,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 08:22:41,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:41,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:41,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1214279410, now seen corresponding path program 2 times [2024-11-12 08:22:41,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:41,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375559557] [2024-11-12 08:22:41,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:41,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:41,695 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:22:41,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:41,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375559557] [2024-11-12 08:22:41,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375559557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:41,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:41,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:22:41,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326103550] [2024-11-12 08:22:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:22:41,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:41,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:22:41,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:22:41,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:41,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 59 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:22:41,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:41,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:41,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:41,845 INFO L124 PetriNetUnfolderBase]: 367/782 cut-off events. [2024-11-12 08:22:41,845 INFO L125 PetriNetUnfolderBase]: For 2674/2682 co-relation queries the response was YES. [2024-11-12 08:22:41,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2822 conditions, 782 events. 367/782 cut-off events. For 2674/2682 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4233 event pairs, 26 based on Foata normal form. 21/729 useless extension candidates. Maximal degree in co-relation 1168. Up to 214 conditions per place. [2024-11-12 08:22:41,852 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 63 selfloop transitions, 10 changer transitions 0/89 dead transitions. [2024-11-12 08:22:41,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 89 transitions, 881 flow [2024-11-12 08:22:41,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:41,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2024-11-12 08:22:41,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.69375 [2024-11-12 08:22:41,853 INFO L175 Difference]: Start difference. First operand has 63 places, 59 transitions, 490 flow. Second operand 5 states and 111 transitions. [2024-11-12 08:22:41,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 89 transitions, 881 flow [2024-11-12 08:22:41,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 89 transitions, 868 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:41,859 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 560 flow [2024-11-12 08:22:41,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=560, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-11-12 08:22:41,860 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 35 predicate places. [2024-11-12 08:22:41,860 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 560 flow [2024-11-12 08:22:41,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 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:22:41,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:41,861 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:41,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 08:22:41,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:41,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 17199342, now seen corresponding path program 3 times [2024-11-12 08:22:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700318533] [2024-11-12 08:22:41,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:41,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:41,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700318533] [2024-11-12 08:22:41,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700318533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:41,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:41,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:41,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134436166] [2024-11-12 08:22:41,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:41,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:41,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:41,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:41,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:41,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:41,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:22:41,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:41,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:41,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:42,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][37], [42#true, Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, 10#L43-2true, 94#true, Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), 4#L86true, 27#L61-1true, Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, 92#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-12 08:22:42,253 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-12 08:22:42,253 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:22:42,253 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-12 08:22:42,254 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:22:42,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][38], [42#true, 20#L46-2true, Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), 94#true, Black: 71#true, Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), 4#L86true, 27#L61-1true, Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, 92#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-12 08:22:42,254 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2024-11-12 08:22:42,255 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:22:42,255 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2024-11-12 08:22:42,255 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2024-11-12 08:22:42,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([249] L43-->L43-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post1_1| v_~pos~0_18) (= (+ |v_thread1Thread1of1ForFork1_#t~post1_1| 1) v_~pos~0_17)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork1_#t~post1=|v_thread1Thread1of1ForFork1_#t~post1_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post1, ~pos~0][37], [42#true, Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), 88#true, Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, 10#L43-2true, 94#true, Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), 4#L86true, 27#L61-1true, Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, Black: 92#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-12 08:22:42,332 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-12 08:22:42,332 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 08:22:42,332 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 08:22:42,332 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:22:42,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([250] L46-->L46-2: Formula: (and (= |v_thread1Thread1of1ForFork1_#t~post2_1| (+ v_~pos~0_13 1)) (= |v_thread1Thread1of1ForFork1_#t~post2_1| v_~pos~0_14)) InVars {~pos~0=v_~pos~0_14} OutVars{thread1Thread1of1ForFork1_#t~post2=|v_thread1Thread1of1ForFork1_#t~post2_1|, ~pos~0=v_~pos~0_13} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post2, ~pos~0][38], [42#true, 20#L46-2true, Black: 65#(<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296))), Black: 67#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (* 2 ~N~0) (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296)))), 88#true, Black: 40#(= (mod ~pos~0 4294967296) 0), 62#true, Black: 76#(and (<= (mod ~i2~0 4294967296) (mod ~i1~0 4294967296)) (<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0))), Black: 71#true, 94#true, Black: 44#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 47#(and (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)) (<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296)))), 4#L86true, 27#L61-1true, Black: 45#(<= (* 2 ~N~0) (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296))), 74#(<= (+ (mod ~i2~0 4294967296) (* (div ~N~0 2147483648) 4294967296) 1) (* 2 ~N~0)), 85#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)), Black: 80#true, Black: 57#(and (<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0)) (<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296))), Black: 54#(<= (mod ~i1~0 4294967296) (mod ~i2~0 4294967296)), Black: 52#true, Black: 92#(and (<= 1 (mod ~N~0 2147483648)) (<= (mod ~i2~0 4294967296) 1)), 55#(<= (+ (* (div ~N~0 2147483648) 4294967296) (mod ~i1~0 4294967296) 1) (* 2 ~N~0))]) [2024-11-12 08:22:42,333 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2024-11-12 08:22:42,333 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 08:22:42,333 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-12 08:22:42,333 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2024-11-12 08:22:42,336 INFO L124 PetriNetUnfolderBase]: 928/1788 cut-off events. [2024-11-12 08:22:42,336 INFO L125 PetriNetUnfolderBase]: For 7226/7305 co-relation queries the response was YES. [2024-11-12 08:22:42,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6832 conditions, 1788 events. 928/1788 cut-off events. For 7226/7305 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 11804 event pairs, 224 based on Foata normal form. 15/1517 useless extension candidates. Maximal degree in co-relation 2026. Up to 541 conditions per place. [2024-11-12 08:22:42,352 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 72 selfloop transitions, 19 changer transitions 0/118 dead transitions. [2024-11-12 08:22:42,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 118 transitions, 1289 flow [2024-11-12 08:22:42,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:22:42,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:22:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2024-11-12 08:22:42,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7578125 [2024-11-12 08:22:42,353 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 560 flow. Second operand 4 states and 97 transitions. [2024-11-12 08:22:42,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 118 transitions, 1289 flow [2024-11-12 08:22:42,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 1280 flow, removed 3 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:42,362 INFO L231 Difference]: Finished difference. Result has 72 places, 81 transitions, 853 flow [2024-11-12 08:22:42,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=555, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=853, PETRI_PLACES=72, PETRI_TRANSITIONS=81} [2024-11-12 08:22:42,363 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 40 predicate places. [2024-11-12 08:22:42,363 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 81 transitions, 853 flow [2024-11-12 08:22:42,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:22:42,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:42,364 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2024-11-12 08:22:42,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-12 08:22:42,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:42,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:42,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1916889584, now seen corresponding path program 1 times [2024-11-12 08:22:42,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:42,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629824335] [2024-11-12 08:22:42,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:42,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:42,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:42,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629824335] [2024-11-12 08:22:42,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629824335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:42,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:42,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 08:22:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986276958] [2024-11-12 08:22:42,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:42,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:22:42,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:42,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:22:42,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:22:42,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:42,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 81 transitions, 853 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:22:42,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:42,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:42,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:42,759 INFO L124 PetriNetUnfolderBase]: 1131/2342 cut-off events. [2024-11-12 08:22:42,760 INFO L125 PetriNetUnfolderBase]: For 13697/13795 co-relation queries the response was YES. [2024-11-12 08:22:42,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10082 conditions, 2342 events. 1131/2342 cut-off events. For 13697/13795 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 16187 event pairs, 260 based on Foata normal form. 30/2263 useless extension candidates. Maximal degree in co-relation 4725. Up to 628 conditions per place. [2024-11-12 08:22:42,784 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 92 selfloop transitions, 13 changer transitions 0/122 dead transitions. [2024-11-12 08:22:42,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 122 transitions, 1469 flow [2024-11-12 08:22:42,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 113 transitions. [2024-11-12 08:22:42,785 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.70625 [2024-11-12 08:22:42,786 INFO L175 Difference]: Start difference. First operand has 72 places, 81 transitions, 853 flow. Second operand 5 states and 113 transitions. [2024-11-12 08:22:42,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 122 transitions, 1469 flow [2024-11-12 08:22:42,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 122 transitions, 1469 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:42,804 INFO L231 Difference]: Finished difference. Result has 77 places, 86 transitions, 965 flow [2024-11-12 08:22:42,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=853, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=965, PETRI_PLACES=77, PETRI_TRANSITIONS=86} [2024-11-12 08:22:42,805 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 45 predicate places. [2024-11-12 08:22:42,805 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 86 transitions, 965 flow [2024-11-12 08:22:42,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 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:22:42,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:42,805 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:42,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-12 08:22:42,805 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:42,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 629533527, now seen corresponding path program 1 times [2024-11-12 08:22:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:42,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161034104] [2024-11-12 08:22:42,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:42,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:22:42,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161034104] [2024-11-12 08:22:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161034104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:42,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:42,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:42,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698498614] [2024-11-12 08:22:42,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:42,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:42,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:42,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:42,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 86 transitions, 965 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:22:43,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:43,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:43,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:43,196 INFO L124 PetriNetUnfolderBase]: 922/1879 cut-off events. [2024-11-12 08:22:43,198 INFO L125 PetriNetUnfolderBase]: For 12216/12275 co-relation queries the response was YES. [2024-11-12 08:22:43,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8148 conditions, 1879 events. 922/1879 cut-off events. For 12216/12275 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 12776 event pairs, 229 based on Foata normal form. 53/1730 useless extension candidates. Maximal degree in co-relation 3813. Up to 564 conditions per place. [2024-11-12 08:22:43,213 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 71 selfloop transitions, 19 changer transitions 0/117 dead transitions. [2024-11-12 08:22:43,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 1478 flow [2024-11-12 08:22:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:22:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:22:43,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-12 08:22:43,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2024-11-12 08:22:43,214 INFO L175 Difference]: Start difference. First operand has 77 places, 86 transitions, 965 flow. Second operand 4 states and 93 transitions. [2024-11-12 08:22:43,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 1478 flow [2024-11-12 08:22:43,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 117 transitions, 1471 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:43,229 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 944 flow [2024-11-12 08:22:43,229 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=879, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=944, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-11-12 08:22:43,230 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 49 predicate places. [2024-11-12 08:22:43,230 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 944 flow [2024-11-12 08:22:43,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:22:43,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:43,230 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-11-12 08:22:43,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 08:22:43,230 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:43,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash 594258551, now seen corresponding path program 2 times [2024-11-12 08:22:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487445051] [2024-11-12 08:22:43,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:43,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:43,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:43,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 08:22:43,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:43,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487445051] [2024-11-12 08:22:43,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487445051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:43,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:43,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:43,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926549347] [2024-11-12 08:22:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:43,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:43,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:43,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:43,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:43,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:43,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 944 flow. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:22:43,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:43,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:43,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:43,676 INFO L124 PetriNetUnfolderBase]: 1457/3063 cut-off events. [2024-11-12 08:22:43,676 INFO L125 PetriNetUnfolderBase]: For 32113/32544 co-relation queries the response was YES. [2024-11-12 08:22:43,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15125 conditions, 3063 events. 1457/3063 cut-off events. For 32113/32544 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 22253 event pairs, 452 based on Foata normal form. 104/2885 useless extension candidates. Maximal degree in co-relation 4133. Up to 830 conditions per place. [2024-11-12 08:22:43,707 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 110 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2024-11-12 08:22:43,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 161 transitions, 2365 flow [2024-11-12 08:22:43,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:22:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:22:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 98 transitions. [2024-11-12 08:22:43,709 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.765625 [2024-11-12 08:22:43,709 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 944 flow. Second operand 4 states and 98 transitions. [2024-11-12 08:22:43,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 161 transitions, 2365 flow [2024-11-12 08:22:43,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 161 transitions, 2365 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:43,726 INFO L231 Difference]: Finished difference. Result has 87 places, 101 transitions, 1372 flow [2024-11-12 08:22:43,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1372, PETRI_PLACES=87, PETRI_TRANSITIONS=101} [2024-11-12 08:22:43,727 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 55 predicate places. [2024-11-12 08:22:43,728 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 101 transitions, 1372 flow [2024-11-12 08:22:43,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 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:22:43,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:43,728 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 08:22:43,729 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:43,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:43,729 INFO L85 PathProgramCache]: Analyzing trace with hash -727168062, now seen corresponding path program 1 times [2024-11-12 08:22:43,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:43,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231104788] [2024-11-12 08:22:43,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:43,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:43,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231104788] [2024-11-12 08:22:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231104788] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:22:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69991983] [2024-11-12 08:22:43,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:43,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:43,894 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:22:43,897 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:22:43,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:43,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 08:22:43,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:22:44,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:44,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:22:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [69991983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:22:44,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:22:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-12 08:22:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033620079] [2024-11-12 08:22:44,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:22:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:22:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:22:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:22:44,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:44,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 101 transitions, 1372 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:22:44,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:44,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:44,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:44,960 INFO L124 PetriNetUnfolderBase]: 2788/6058 cut-off events. [2024-11-12 08:22:44,960 INFO L125 PetriNetUnfolderBase]: For 58812/59039 co-relation queries the response was YES. [2024-11-12 08:22:45,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31210 conditions, 6058 events. 2788/6058 cut-off events. For 58812/59039 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 49047 event pairs, 533 based on Foata normal form. 84/5955 useless extension candidates. Maximal degree in co-relation 13945. Up to 2388 conditions per place. [2024-11-12 08:22:45,047 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 183 selfloop transitions, 21 changer transitions 1/230 dead transitions. [2024-11-12 08:22:45,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 230 transitions, 3684 flow [2024-11-12 08:22:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:45,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2024-11-12 08:22:45,049 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78125 [2024-11-12 08:22:45,049 INFO L175 Difference]: Start difference. First operand has 87 places, 101 transitions, 1372 flow. Second operand 5 states and 125 transitions. [2024-11-12 08:22:45,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 230 transitions, 3684 flow [2024-11-12 08:22:45,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 230 transitions, 3684 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:45,103 INFO L231 Difference]: Finished difference. Result has 92 places, 113 transitions, 1487 flow [2024-11-12 08:22:45,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1487, PETRI_PLACES=92, PETRI_TRANSITIONS=113} [2024-11-12 08:22:45,112 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 60 predicate places. [2024-11-12 08:22:45,112 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 113 transitions, 1487 flow [2024-11-12 08:22:45,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:22:45,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:45,116 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:45,133 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:22:45,320 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,SelfDestructingSolverStorable11 [2024-11-12 08:22:45,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash 717374830, now seen corresponding path program 2 times [2024-11-12 08:22:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251159985] [2024-11-12 08:22:45,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:45,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 08:22:45,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251159985] [2024-11-12 08:22:45,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251159985] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:22:45,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725766118] [2024-11-12 08:22:45,532 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 08:22:45,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:45,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:45,534 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:22:45,535 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:22:45,586 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 08:22:45,587 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:22:45,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 08:22:45,589 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:22:45,663 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 08:22:45,663 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:22:45,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 08:22:45,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725766118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:22:45,731 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:22:45,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2024-11-12 08:22:45,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633369613] [2024-11-12 08:22:45,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:22:45,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 08:22:45,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:45,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 08:22:45,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 08:22:45,738 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:45,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 113 transitions, 1487 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:22:45,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:45,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:45,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:46,660 INFO L124 PetriNetUnfolderBase]: 3599/7887 cut-off events. [2024-11-12 08:22:46,661 INFO L125 PetriNetUnfolderBase]: For 81140/81571 co-relation queries the response was YES. [2024-11-12 08:22:46,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42920 conditions, 7887 events. 3599/7887 cut-off events. For 81140/81571 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 67469 event pairs, 766 based on Foata normal form. 129/7763 useless extension candidates. Maximal degree in co-relation 17201. Up to 4376 conditions per place. [2024-11-12 08:22:46,712 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 173 selfloop transitions, 20 changer transitions 1/219 dead transitions. [2024-11-12 08:22:46,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 219 transitions, 3436 flow [2024-11-12 08:22:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 08:22:46,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-12 08:22:46,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2024-11-12 08:22:46,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7625 [2024-11-12 08:22:46,713 INFO L175 Difference]: Start difference. First operand has 92 places, 113 transitions, 1487 flow. Second operand 5 states and 122 transitions. [2024-11-12 08:22:46,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 219 transitions, 3436 flow [2024-11-12 08:22:46,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 219 transitions, 3390 flow, removed 23 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:46,758 INFO L231 Difference]: Finished difference. Result has 97 places, 124 transitions, 1572 flow [2024-11-12 08:22:46,758 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1572, PETRI_PLACES=97, PETRI_TRANSITIONS=124} [2024-11-12 08:22:46,759 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 65 predicate places. [2024-11-12 08:22:46,759 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 124 transitions, 1572 flow [2024-11-12 08:22:46,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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:22:46,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:46,760 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:46,777 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:22:46,960 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,SelfDestructingSolverStorable12 [2024-11-12 08:22:46,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:46,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:46,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1632188460, now seen corresponding path program 3 times [2024-11-12 08:22:46,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:46,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930242635] [2024-11-12 08:22:46,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:46,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:47,240 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:22:47,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:47,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930242635] [2024-11-12 08:22:47,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930242635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:22:47,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503203729] [2024-11-12 08:22:47,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 08:22:47,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:47,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:47,243 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:22:47,248 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:22:47,300 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 08:22:47,301 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:22:47,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 08:22:47,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:22:47,375 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:22:47,375 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:22:47,461 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:22:47,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503203729] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:22:47,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:22:47,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 08:22:47,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518505612] [2024-11-12 08:22:47,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:22:47,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:22:47,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:47,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:22:47,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:22:47,472 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:47,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 124 transitions, 1572 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:47,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:47,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:47,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:48,821 INFO L124 PetriNetUnfolderBase]: 4953/10922 cut-off events. [2024-11-12 08:22:48,821 INFO L125 PetriNetUnfolderBase]: For 111396/111830 co-relation queries the response was YES. [2024-11-12 08:22:48,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58971 conditions, 10922 events. 4953/10922 cut-off events. For 111396/111830 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 97532 event pairs, 822 based on Foata normal form. 180/10771 useless extension candidates. Maximal degree in co-relation 21771. Up to 3621 conditions per place. [2024-11-12 08:22:48,892 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 238 selfloop transitions, 42 changer transitions 1/306 dead transitions. [2024-11-12 08:22:48,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 306 transitions, 4852 flow [2024-11-12 08:22:48,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:22:48,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:22:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-11-12 08:22:48,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2024-11-12 08:22:48,894 INFO L175 Difference]: Start difference. First operand has 97 places, 124 transitions, 1572 flow. Second operand 6 states and 152 transitions. [2024-11-12 08:22:48,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 306 transitions, 4852 flow [2024-11-12 08:22:48,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 306 transitions, 4832 flow, removed 10 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:48,953 INFO L231 Difference]: Finished difference. Result has 104 places, 145 transitions, 1826 flow [2024-11-12 08:22:48,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1558, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1826, PETRI_PLACES=104, PETRI_TRANSITIONS=145} [2024-11-12 08:22:48,954 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 72 predicate places. [2024-11-12 08:22:48,954 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 145 transitions, 1826 flow [2024-11-12 08:22:48,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:48,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:48,954 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:48,968 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:22:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:49,159 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:49,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:49,161 INFO L85 PathProgramCache]: Analyzing trace with hash 562853332, now seen corresponding path program 4 times [2024-11-12 08:22:49,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:49,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893018449] [2024-11-12 08:22:49,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:49,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:49,283 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:22:49,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:49,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893018449] [2024-11-12 08:22:49,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893018449] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:22:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261649780] [2024-11-12 08:22:49,285 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-12 08:22:49,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:49,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:49,288 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:22:49,292 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:22:49,339 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-12 08:22:49,340 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:22:49,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 08:22:49,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:22:49,400 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:22:49,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:22:49,494 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:22:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261649780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:22:49,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:22:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 08:22:49,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445529684] [2024-11-12 08:22:49,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:22:49,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:22:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:49,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:22:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:22:49,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:49,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 145 transitions, 1826 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:49,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:49,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:49,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:51,247 INFO L124 PetriNetUnfolderBase]: 5168/11443 cut-off events. [2024-11-12 08:22:51,247 INFO L125 PetriNetUnfolderBase]: For 124066/124567 co-relation queries the response was YES. [2024-11-12 08:22:51,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64578 conditions, 11443 events. 5168/11443 cut-off events. For 124066/124567 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 103839 event pairs, 1099 based on Foata normal form. 235/11338 useless extension candidates. Maximal degree in co-relation 30840. Up to 6231 conditions per place. [2024-11-12 08:22:51,332 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 217 selfloop transitions, 34 changer transitions 1/277 dead transitions. [2024-11-12 08:22:51,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 277 transitions, 4384 flow [2024-11-12 08:22:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:22:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:22:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-11-12 08:22:51,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2024-11-12 08:22:51,334 INFO L175 Difference]: Start difference. First operand has 104 places, 145 transitions, 1826 flow. Second operand 6 states and 145 transitions. [2024-11-12 08:22:51,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 277 transitions, 4384 flow [2024-11-12 08:22:51,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 277 transitions, 4339 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:51,434 INFO L231 Difference]: Finished difference. Result has 109 places, 153 transitions, 1952 flow [2024-11-12 08:22:51,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1787, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1952, PETRI_PLACES=109, PETRI_TRANSITIONS=153} [2024-11-12 08:22:51,436 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 77 predicate places. [2024-11-12 08:22:51,436 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 153 transitions, 1952 flow [2024-11-12 08:22:51,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:51,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:51,437 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:51,464 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:22:51,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-12 08:22:51,638 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:51,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:51,638 INFO L85 PathProgramCache]: Analyzing trace with hash 766959052, now seen corresponding path program 5 times [2024-11-12 08:22:51,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:51,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956899115] [2024-11-12 08:22:51,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:51,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:51,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:51,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956899115] [2024-11-12 08:22:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956899115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:22:51,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310833144] [2024-11-12 08:22:51,846 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-12 08:22:51,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:51,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:51,851 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:22:51,855 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:22:51,911 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 08:22:51,912 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:22:51,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 08:22:51,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:22:51,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:51,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:22:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:52,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310833144] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:22:52,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:22:52,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 08:22:52,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489667831] [2024-11-12 08:22:52,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:22:52,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:22:52,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:22:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:22:52,055 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:52,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 153 transitions, 1952 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:52,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:52,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:52,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:54,222 INFO L124 PetriNetUnfolderBase]: 6446/14365 cut-off events. [2024-11-12 08:22:54,223 INFO L125 PetriNetUnfolderBase]: For 158399/158982 co-relation queries the response was YES. [2024-11-12 08:22:54,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81955 conditions, 14365 events. 6446/14365 cut-off events. For 158399/158982 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 135518 event pairs, 1093 based on Foata normal form. 265/14213 useless extension candidates. Maximal degree in co-relation 45653. Up to 6276 conditions per place. [2024-11-12 08:22:54,354 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 269 selfloop transitions, 34 changer transitions 1/329 dead transitions. [2024-11-12 08:22:54,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 329 transitions, 5307 flow [2024-11-12 08:22:54,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:22:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:22:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 152 transitions. [2024-11-12 08:22:54,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2024-11-12 08:22:54,359 INFO L175 Difference]: Start difference. First operand has 109 places, 153 transitions, 1952 flow. Second operand 6 states and 152 transitions. [2024-11-12 08:22:54,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 329 transitions, 5307 flow [2024-11-12 08:22:54,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 329 transitions, 5256 flow, removed 16 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:54,529 INFO L231 Difference]: Finished difference. Result has 114 places, 166 transitions, 2134 flow [2024-11-12 08:22:54,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2134, PETRI_PLACES=114, PETRI_TRANSITIONS=166} [2024-11-12 08:22:54,530 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 82 predicate places. [2024-11-12 08:22:54,530 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 166 transitions, 2134 flow [2024-11-12 08:22:54,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:54,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:54,531 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 08:22:54,544 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:22:54,731 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,SelfDestructingSolverStorable15 [2024-11-12 08:22:54,732 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:54,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:54,732 INFO L85 PathProgramCache]: Analyzing trace with hash 753364786, now seen corresponding path program 6 times [2024-11-12 08:22:54,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:54,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650757221] [2024-11-12 08:22:54,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:54,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650757221] [2024-11-12 08:22:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650757221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:22:55,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126384422] [2024-11-12 08:22:55,024 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-12 08:22:55,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:22:55,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:22:55,026 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:22:55,035 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:22:55,108 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2024-11-12 08:22:55,108 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 08:22:55,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-12 08:22:55,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:22:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:55,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:22:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:22:55,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126384422] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:22:55,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:22:55,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2024-11-12 08:22:55,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450547455] [2024-11-12 08:22:55,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:22:55,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 08:22:55,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:55,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 08:22:55,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 08:22:55,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 32 [2024-11-12 08:22:55,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 166 transitions, 2134 flow. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:55,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:55,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 32 [2024-11-12 08:22:55,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:57,762 INFO L124 PetriNetUnfolderBase]: 7590/16913 cut-off events. [2024-11-12 08:22:57,762 INFO L125 PetriNetUnfolderBase]: For 193886/194504 co-relation queries the response was YES. [2024-11-12 08:22:57,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98489 conditions, 16913 events. 7590/16913 cut-off events. For 193886/194504 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 164363 event pairs, 1520 based on Foata normal form. 283/16630 useless extension candidates. Maximal degree in co-relation 49156. Up to 8264 conditions per place. [2024-11-12 08:22:57,912 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 256 selfloop transitions, 57 changer transitions 1/339 dead transitions. [2024-11-12 08:22:57,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 339 transitions, 5375 flow [2024-11-12 08:22:57,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 08:22:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-12 08:22:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-11-12 08:22:57,914 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7760416666666666 [2024-11-12 08:22:57,914 INFO L175 Difference]: Start difference. First operand has 114 places, 166 transitions, 2134 flow. Second operand 6 states and 149 transitions. [2024-11-12 08:22:57,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 339 transitions, 5375 flow [2024-11-12 08:22:58,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 339 transitions, 5315 flow, removed 30 selfloop flow, removed 0 redundant places. [2024-11-12 08:22:58,062 INFO L231 Difference]: Finished difference. Result has 122 places, 194 transitions, 2592 flow [2024-11-12 08:22:58,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2592, PETRI_PLACES=122, PETRI_TRANSITIONS=194} [2024-11-12 08:22:58,062 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 90 predicate places. [2024-11-12 08:22:58,062 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 194 transitions, 2592 flow [2024-11-12 08:22:58,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 6 states have internal predecessors, (98), 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:22:58,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:58,063 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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] [2024-11-12 08:22:58,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-12 08:22:58,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-12 08:22:58,264 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash -610413383, now seen corresponding path program 1 times [2024-11-12 08:22:58,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:58,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342866106] [2024-11-12 08:22:58,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:22:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 08:22:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:22:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342866106] [2024-11-12 08:22:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342866106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 08:22:58,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 08:22:58,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 08:22:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769777914] [2024-11-12 08:22:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 08:22:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 08:22:58,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:22:58,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 08:22:58,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 08:22:58,344 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:22:58,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 194 transitions, 2592 flow. Second operand has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:22:58,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:22:58,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:22:58,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:22:59,385 INFO L124 PetriNetUnfolderBase]: 3710/8312 cut-off events. [2024-11-12 08:22:59,386 INFO L125 PetriNetUnfolderBase]: For 110257/111218 co-relation queries the response was YES. [2024-11-12 08:22:59,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49515 conditions, 8312 events. 3710/8312 cut-off events. For 110257/111218 co-relation queries the response was YES. Maximal size of possible extension queue 378. Compared 72783 event pairs, 685 based on Foata normal form. 274/8258 useless extension candidates. Maximal degree in co-relation 22777. Up to 2641 conditions per place. [2024-11-12 08:22:59,702 INFO L140 encePairwiseOnDemand]: 28/32 looper letters, 127 selfloop transitions, 22 changer transitions 0/212 dead transitions. [2024-11-12 08:22:59,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 212 transitions, 3177 flow [2024-11-12 08:22:59,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 08:22:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-12 08:22:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 93 transitions. [2024-11-12 08:22:59,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7265625 [2024-11-12 08:22:59,703 INFO L175 Difference]: Start difference. First operand has 122 places, 194 transitions, 2592 flow. Second operand 4 states and 93 transitions. [2024-11-12 08:22:59,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 212 transitions, 3177 flow [2024-11-12 08:22:59,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 212 transitions, 3135 flow, removed 14 selfloop flow, removed 1 redundant places. [2024-11-12 08:22:59,787 INFO L231 Difference]: Finished difference. Result has 126 places, 166 transitions, 2273 flow [2024-11-12 08:22:59,787 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2199, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2273, PETRI_PLACES=126, PETRI_TRANSITIONS=166} [2024-11-12 08:22:59,788 INFO L279 CegarLoopForPetriNet]: 32 programPoint places, 94 predicate places. [2024-11-12 08:22:59,789 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 166 transitions, 2273 flow [2024-11-12 08:22:59,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.5) internal successors, (74), 4 states have internal predecessors, (74), 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:22:59,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-12 08:22:59,789 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 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] [2024-11-12 08:22:59,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 08:22:59,790 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-12 08:22:59,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 08:22:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 367266382, now seen corresponding path program 7 times [2024-11-12 08:22:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 08:22:59,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073260335] [2024-11-12 08:22:59,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 08:22:59,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 08:22:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:23:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:23:00,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 08:23:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073260335] [2024-11-12 08:23:00,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073260335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 08:23:00,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324095068] [2024-11-12 08:23:00,151 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-12 08:23:00,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 08:23:00,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 08:23:00,157 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:23:00,158 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:23:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 08:23:00,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-12 08:23:00,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 08:23:01,099 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:23:01,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 08:23:15,184 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 08:23:15,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324095068] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 08:23:15,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 08:23:15,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 21 [2024-11-12 08:23:15,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898282736] [2024-11-12 08:23:15,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 08:23:15,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-12 08:23:15,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 08:23:15,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-12 08:23:15,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=352, Unknown=3, NotChecked=0, Total=420 [2024-11-12 08:23:15,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 32 [2024-11-12 08:23:15,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 166 transitions, 2273 flow. Second operand has 21 states, 21 states have (on average 16.428571428571427) internal successors, (345), 21 states have internal predecessors, (345), 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:23:15,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-12 08:23:15,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 32 [2024-11-12 08:23:15,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-12 08:23:23,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 08:23:28,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-12 08:23:38,374 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification. DAG size of input: 61 DAG size of output: 38 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 08:23:50,063 WARN L286 SmtUtils]: Spent 11.37s on a formula simplification. DAG size of input: 64 DAG size of output: 37 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-12 08:24:03,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []