./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 3ace826ce717f8420bd44e3ebb10a0f5689c8f1d5dcaf8399a3f9b8d8dda146f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 14:12:25,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 14:12:25,559 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 14:12:25,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 14:12:25,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 14:12:25,579 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 14:12:25,580 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 14:12:25,580 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 14:12:25,581 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 14:12:25,581 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 14:12:25,581 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 14:12:25,582 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 14:12:25,582 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 14:12:25,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 14:12:25,583 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 14:12:25,583 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 14:12:25,583 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 14:12:25,584 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 14:12:25,584 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 14:12:25,584 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 14:12:25,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 14:12:25,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 14:12:25,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 14:12:25,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 14:12:25,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 14:12:25,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 14:12:25,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 14:12:25,587 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 14:12:25,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 14:12:25,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 14:12:25,588 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 14:12:25,588 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 14:12:25,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:12:25,589 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 14:12:25,589 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 14:12:25,589 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 14:12:25,589 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 14:12:25,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 14:12:25,590 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 14:12:25,590 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 14:12:25,590 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 14:12:25,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 14:12:25,591 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-clean/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-clean/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 -> 3ace826ce717f8420bd44e3ebb10a0f5689c8f1d5dcaf8399a3f9b8d8dda146f [2024-10-11 14:12:25,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 14:12:25,830 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 14:12:25,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 14:12:25,835 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 14:12:25,836 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 14:12:25,837 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-10-11 14:12:27,163 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 14:12:27,402 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 14:12:27,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i [2024-10-11 14:12:27,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56ea30981/af7c8157f4df4edc93d79d0514b1cd4e/FLAG674cb1031 [2024-10-11 14:12:27,431 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/56ea30981/af7c8157f4df4edc93d79d0514b1cd4e [2024-10-11 14:12:27,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 14:12:27,435 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 14:12:27,436 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 14:12:27,436 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 14:12:27,441 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 14:12:27,441 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1955d7ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27, skipping insertion in model container [2024-10-11 14:12:27,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,487 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 14:12:27,809 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30438,30451] [2024-10-11 14:12:27,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:12:27,823 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 14:12:27,869 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/31_simple_loop5_vs.i[30438,30451] [2024-10-11 14:12:27,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 14:12:27,910 INFO L204 MainTranslator]: Completed translation [2024-10-11 14:12:27,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27 WrapperNode [2024-10-11 14:12:27,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 14:12:27,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 14:12:27,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 14:12:27,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 14:12:27,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,929 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,948 INFO L138 Inliner]: procedures = 169, calls = 14, calls flagged for inlining = 8, calls inlined = 10, statements flattened = 78 [2024-10-11 14:12:27,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 14:12:27,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 14:12:27,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 14:12:27,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 14:12:27,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,959 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,982 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-10-11 14:12:27,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:27,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:28,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:28,002 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 14:12:28,002 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 14:12:28,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 14:12:28,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 14:12:28,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (1/1) ... [2024-10-11 14:12:28,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 14:12:28,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:12:28,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 14:12:28,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 14:12:28,080 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-11 14:12:28,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-11 14:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 14:12:28,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 14:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 14:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 14:12:28,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 14:12:28,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 14:12:28,083 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 14:12:28,175 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 14:12:28,177 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 14:12:28,282 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 14:12:28,282 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 14:12:28,355 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 14:12:28,356 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-11 14:12:28,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:12:28 BoogieIcfgContainer [2024-10-11 14:12:28,356 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 14:12:28,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 14:12:28,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 14:12:28,360 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 14:12:28,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:12:27" (1/3) ... [2024-10-11 14:12:28,361 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfcd3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:12:28, skipping insertion in model container [2024-10-11 14:12:28,361 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:12:27" (2/3) ... [2024-10-11 14:12:28,362 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cfcd3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:12:28, skipping insertion in model container [2024-10-11 14:12:28,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:12:28" (3/3) ... [2024-10-11 14:12:28,363 INFO L112 eAbstractionObserver]: Analyzing ICFG 31_simple_loop5_vs.i [2024-10-11 14:12:28,376 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 14:12:28,376 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 14:12:28,377 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 14:12:28,407 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:28,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 23 transitions, 54 flow [2024-10-11 14:12:28,465 INFO L124 PetriNetUnfolderBase]: 3/24 cut-off events. [2024-10-11 14:12:28,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:28,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31 conditions, 24 events. 3/24 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 51 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2024-10-11 14:12:28,469 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 23 transitions, 54 flow [2024-10-11 14:12:28,472 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 51 flow [2024-10-11 14:12:28,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:28,494 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;@4344a977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:28,494 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 14:12:28,504 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:28,506 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2024-10-11 14:12:28,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:28,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:28,507 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:28,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:12:28,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:28,513 INFO L85 PathProgramCache]: Analyzing trace with hash 78026650, now seen corresponding path program 1 times [2024-10-11 14:12:28,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:28,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166014110] [2024-10-11 14:12:28,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:28,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:28,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:28,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166014110] [2024-10-11 14:12:28,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166014110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:28,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:28,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256992731] [2024-10-11 14:12:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:28,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:28,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:28,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:28,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:28,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 23 [2024-10-11 14:12:28,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 51 flow. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-11 14:12:28,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:28,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 23 [2024-10-11 14:12:28,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:28,892 INFO L124 PetriNetUnfolderBase]: 99/188 cut-off events. [2024-10-11 14:12:28,892 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:28,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 188 events. 99/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 681 event pairs, 27 based on Foata normal form. 53/237 useless extension candidates. Maximal degree in co-relation 352. Up to 106 conditions per place. [2024-10-11 14:12:28,897 INFO L140 encePairwiseOnDemand]: 16/23 looper letters, 16 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2024-10-11 14:12:28,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 91 flow [2024-10-11 14:12:28,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:28,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2024-10-11 14:12:28,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2024-10-11 14:12:28,909 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 51 flow. Second operand 3 states and 47 transitions. [2024-10-11 14:12:28,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 91 flow [2024-10-11 14:12:28,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 24 transitions, 90 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:28,913 INFO L231 Difference]: Finished difference. Result has 24 places, 19 transitions, 54 flow [2024-10-11 14:12:28,915 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=23, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=24, PETRI_TRANSITIONS=19} [2024-10-11 14:12:28,917 INFO L277 CegarLoopForPetriNet]: 25 programPoint places, -1 predicate places. [2024-10-11 14:12:28,918 INFO L471 AbstractCegarLoop]: Abstraction has has 24 places, 19 transitions, 54 flow [2024-10-11 14:12:28,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-11 14:12:28,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:28,918 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:28,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 14:12:28,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-10-11 14:12:28,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:28,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2127158844, now seen corresponding path program 1 times [2024-10-11 14:12:28,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:28,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921028521] [2024-10-11 14:12:28,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:28,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:28,938 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:28,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:28,988 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:28,990 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-10-11 14:12:28,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-10-11 14:12:28,991 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-10-11 14:12:28,992 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-10-11 14:12:28,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 14:12:28,992 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:28,994 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:28,994 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-11 14:12:29,017 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:29,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 39 transitions, 98 flow [2024-10-11 14:12:29,049 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2024-10-11 14:12:29,049 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 14:12:29,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 33 events. 4/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 63 event pairs, 0 based on Foata normal form. 0/25 useless extension candidates. Maximal degree in co-relation 40. Up to 3 conditions per place. [2024-10-11 14:12:29,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 39 transitions, 98 flow [2024-10-11 14:12:29,054 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 28 transitions, 69 flow [2024-10-11 14:12:29,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:29,057 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;@4344a977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:29,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-10-11 14:12:29,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:29,069 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2024-10-11 14:12:29,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:29,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:29,072 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:29,073 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:12:29,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1918895415, now seen corresponding path program 1 times [2024-10-11 14:12:29,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:29,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122727550] [2024-10-11 14:12:29,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:29,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:29,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:29,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:29,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122727550] [2024-10-11 14:12:29,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122727550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:29,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:29,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:29,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209788034] [2024-10-11 14:12:29,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:29,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:29,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:29,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:29,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:29,170 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 39 [2024-10-11 14:12:29,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 14:12:29,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:29,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 39 [2024-10-11 14:12:29,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:29,325 INFO L124 PetriNetUnfolderBase]: 693/1036 cut-off events. [2024-10-11 14:12:29,325 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-10-11 14:12:29,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1036 events. 693/1036 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4504 event pairs, 138 based on Foata normal form. 224/1252 useless extension candidates. Maximal degree in co-relation 2064. Up to 814 conditions per place. [2024-10-11 14:12:29,337 INFO L140 encePairwiseOnDemand]: 30/39 looper letters, 22 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-10-11 14:12:29,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 132 flow [2024-10-11 14:12:29,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2024-10-11 14:12:29,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6068376068376068 [2024-10-11 14:12:29,342 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 69 flow. Second operand 3 states and 71 transitions. [2024-10-11 14:12:29,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 132 flow [2024-10-11 14:12:29,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:29,345 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 77 flow [2024-10-11 14:12:29,345 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=39, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2024-10-11 14:12:29,346 INFO L277 CegarLoopForPetriNet]: 32 programPoint places, -2 predicate places. [2024-10-11 14:12:29,346 INFO L471 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 77 flow [2024-10-11 14:12:29,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 14:12:29,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:29,346 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:29,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 14:12:29,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2024-10-11 14:12:29,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:29,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1391252147, now seen corresponding path program 1 times [2024-10-11 14:12:29,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:29,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950394718] [2024-10-11 14:12:29,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:29,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:29,365 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:29,382 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:29,385 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:29,385 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-10-11 14:12:29,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-10-11 14:12:29,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2024-10-11 14:12:29,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-10-11 14:12:29,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-10-11 14:12:29,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 14:12:29,386 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-11 14:12:29,387 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:29,387 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-11 14:12:29,407 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:29,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 60 places, 55 transitions, 146 flow [2024-10-11 14:12:29,414 INFO L124 PetriNetUnfolderBase]: 5/42 cut-off events. [2024-10-11 14:12:29,414 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 14:12:29,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60 conditions, 42 events. 5/42 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 53. Up to 4 conditions per place. [2024-10-11 14:12:29,415 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 55 transitions, 146 flow [2024-10-11 14:12:29,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 34 transitions, 89 flow [2024-10-11 14:12:29,417 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:29,418 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;@4344a977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:29,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-10-11 14:12:29,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:29,421 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2024-10-11 14:12:29,421 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:29,421 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:29,421 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:29,422 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:12:29,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1261877933, now seen corresponding path program 1 times [2024-10-11 14:12:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391548250] [2024-10-11 14:12:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:29,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:29,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:29,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391548250] [2024-10-11 14:12:29,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391548250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:29,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:29,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:29,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248783958] [2024-10-11 14:12:29,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:29,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:29,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:29,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:29,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:29,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 14:12:29,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-10-11 14:12:29,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:29,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 14:12:29,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:29,956 INFO L124 PetriNetUnfolderBase]: 3801/5056 cut-off events. [2024-10-11 14:12:29,956 INFO L125 PetriNetUnfolderBase]: For 515/515 co-relation queries the response was YES. [2024-10-11 14:12:29,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10320 conditions, 5056 events. 3801/5056 cut-off events. For 515/515 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 23099 event pairs, 723 based on Foata normal form. 862/5892 useless extension candidates. Maximal degree in co-relation 10308. Up to 4510 conditions per place. [2024-10-11 14:12:30,036 INFO L140 encePairwiseOnDemand]: 44/55 looper letters, 28 selfloop transitions, 4 changer transitions 0/40 dead transitions. [2024-10-11 14:12:30,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 177 flow [2024-10-11 14:12:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:30,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-10-11 14:12:30,042 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2024-10-11 14:12:30,042 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 89 flow. Second operand 3 states and 95 transitions. [2024-10-11 14:12:30,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 177 flow [2024-10-11 14:12:30,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 172 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:30,044 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 100 flow [2024-10-11 14:12:30,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2024-10-11 14:12:30,045 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -3 predicate places. [2024-10-11 14:12:30,048 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 100 flow [2024-10-11 14:12:30,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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-10-11 14:12:30,048 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:30,049 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:30,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 14:12:30,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:12:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:30,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1738631724, now seen corresponding path program 1 times [2024-10-11 14:12:30,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:30,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776705692] [2024-10-11 14:12:30,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:30,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:30,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776705692] [2024-10-11 14:12:30,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776705692] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:30,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:30,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:30,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731786641] [2024-10-11 14:12:30,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:30,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:30,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:30,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:30,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:30,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 55 [2024-10-11 14:12:30,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-10-11 14:12:30,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:30,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 55 [2024-10-11 14:12:30,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:30,226 INFO L124 PetriNetUnfolderBase]: 459/940 cut-off events. [2024-10-11 14:12:30,228 INFO L125 PetriNetUnfolderBase]: For 143/143 co-relation queries the response was YES. [2024-10-11 14:12:30,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2101 conditions, 940 events. 459/940 cut-off events. For 143/143 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 4887 event pairs, 87 based on Foata normal form. 691/1614 useless extension candidates. Maximal degree in co-relation 2087. Up to 608 conditions per place. [2024-10-11 14:12:30,235 INFO L140 encePairwiseOnDemand]: 47/55 looper letters, 20 selfloop transitions, 8 changer transitions 0/37 dead transitions. [2024-10-11 14:12:30,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 37 transitions, 181 flow [2024-10-11 14:12:30,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2024-10-11 14:12:30,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5393939393939394 [2024-10-11 14:12:30,240 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 100 flow. Second operand 3 states and 89 transitions. [2024-10-11 14:12:30,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 37 transitions, 181 flow [2024-10-11 14:12:30,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 177 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:30,243 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 112 flow [2024-10-11 14:12:30,244 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2024-10-11 14:12:30,244 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, -2 predicate places. [2024-10-11 14:12:30,245 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 112 flow [2024-10-11 14:12:30,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-10-11 14:12:30,245 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:30,245 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:30,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 14:12:30,246 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:12:30,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:30,246 INFO L85 PathProgramCache]: Analyzing trace with hash -2073841517, now seen corresponding path program 1 times [2024-10-11 14:12:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:30,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039593012] [2024-10-11 14:12:30,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:30,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:30,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:30,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039593012] [2024-10-11 14:12:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039593012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:30,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:30,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85352502] [2024-10-11 14:12:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:30,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:12:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:12:30,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:12:30,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 55 [2024-10-11 14:12:30,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-10-11 14:12:30,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:30,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 55 [2024-10-11 14:12:30,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:30,472 INFO L124 PetriNetUnfolderBase]: 752/1449 cut-off events. [2024-10-11 14:12:30,472 INFO L125 PetriNetUnfolderBase]: For 374/374 co-relation queries the response was YES. [2024-10-11 14:12:30,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3887 conditions, 1449 events. 752/1449 cut-off events. For 374/374 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8169 event pairs, 51 based on Foata normal form. 18/1459 useless extension candidates. Maximal degree in co-relation 3873. Up to 849 conditions per place. [2024-10-11 14:12:30,482 INFO L140 encePairwiseOnDemand]: 50/55 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-10-11 14:12:30,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 306 flow [2024-10-11 14:12:30,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:12:30,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:12:30,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-10-11 14:12:30,484 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5272727272727272 [2024-10-11 14:12:30,485 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 112 flow. Second operand 4 states and 116 transitions. [2024-10-11 14:12:30,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 306 flow [2024-10-11 14:12:30,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:30,490 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 144 flow [2024-10-11 14:12:30,490 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=55, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=144, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2024-10-11 14:12:30,491 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 1 predicate places. [2024-10-11 14:12:30,492 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 144 flow [2024-10-11 14:12:30,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-10-11 14:12:30,492 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:30,492 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:30,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 14:12:30,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2024-10-11 14:12:30,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash 521615329, now seen corresponding path program 1 times [2024-10-11 14:12:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:30,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498079990] [2024-10-11 14:12:30,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:30,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:30,514 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:30,526 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:30,528 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:30,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2024-10-11 14:12:30,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2024-10-11 14:12:30,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2024-10-11 14:12:30,528 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2024-10-11 14:12:30,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2024-10-11 14:12:30,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2024-10-11 14:12:30,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 14:12:30,531 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 14:12:30,531 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:30,531 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-11 14:12:30,560 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:30,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 71 transitions, 198 flow [2024-10-11 14:12:30,566 INFO L124 PetriNetUnfolderBase]: 6/51 cut-off events. [2024-10-11 14:12:30,567 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-11 14:12:30,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 51 events. 6/51 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 88 event pairs, 0 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 67. Up to 5 conditions per place. [2024-10-11 14:12:30,567 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 71 transitions, 198 flow [2024-10-11 14:12:30,568 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 40 transitions, 111 flow [2024-10-11 14:12:30,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:30,569 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;@4344a977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:30,570 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-10-11 14:12:30,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:30,571 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2024-10-11 14:12:30,571 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:30,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:30,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:30,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:12:30,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:30,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1893025796, now seen corresponding path program 1 times [2024-10-11 14:12:30,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:30,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074787300] [2024-10-11 14:12:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:30,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:30,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:30,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:30,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:30,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074787300] [2024-10-11 14:12:30,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074787300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:30,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:30,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:30,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536295923] [2024-10-11 14:12:30,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:30,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:30,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:30,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:30,659 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-10-11 14:12:30,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-10-11 14:12:30,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:30,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-10-11 14:12:30,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:32,281 INFO L124 PetriNetUnfolderBase]: 19029/23680 cut-off events. [2024-10-11 14:12:32,281 INFO L125 PetriNetUnfolderBase]: For 3395/3395 co-relation queries the response was YES. [2024-10-11 14:12:32,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48757 conditions, 23680 events. 19029/23680 cut-off events. For 3395/3395 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 109743 event pairs, 3960 based on Foata normal form. 3302/26918 useless extension candidates. Maximal degree in co-relation 48744. Up to 22390 conditions per place. [2024-10-11 14:12:32,424 INFO L140 encePairwiseOnDemand]: 58/71 looper letters, 34 selfloop transitions, 5 changer transitions 0/48 dead transitions. [2024-10-11 14:12:32,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 48 transitions, 226 flow [2024-10-11 14:12:32,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:32,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2024-10-11 14:12:32,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5586854460093896 [2024-10-11 14:12:32,426 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 111 flow. Second operand 3 states and 119 transitions. [2024-10-11 14:12:32,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 48 transitions, 226 flow [2024-10-11 14:12:32,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 48 transitions, 213 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:32,431 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 123 flow [2024-10-11 14:12:32,431 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2024-10-11 14:12:32,432 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -4 predicate places. [2024-10-11 14:12:32,433 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 123 flow [2024-10-11 14:12:32,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 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-10-11 14:12:32,433 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:32,433 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:32,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 14:12:32,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:12:32,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 900921764, now seen corresponding path program 1 times [2024-10-11 14:12:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578418809] [2024-10-11 14:12:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:32,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:32,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578418809] [2024-10-11 14:12:32,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578418809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:32,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:32,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:32,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024378042] [2024-10-11 14:12:32,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:32,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:32,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:32,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:32,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:32,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 71 [2024-10-11 14:12:32,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-10-11 14:12:32,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:32,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 71 [2024-10-11 14:12:32,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:32,670 INFO L124 PetriNetUnfolderBase]: 1176/2293 cut-off events. [2024-10-11 14:12:32,671 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-10-11 14:12:32,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5161 conditions, 2293 events. 1176/2293 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 13709 event pairs, 214 based on Foata normal form. 2343/4605 useless extension candidates. Maximal degree in co-relation 5146. Up to 1539 conditions per place. [2024-10-11 14:12:32,687 INFO L140 encePairwiseOnDemand]: 61/71 looper letters, 24 selfloop transitions, 10 changer transitions 0/44 dead transitions. [2024-10-11 14:12:32,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 44 transitions, 223 flow [2024-10-11 14:12:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:32,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-10-11 14:12:32,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5305164319248826 [2024-10-11 14:12:32,689 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 123 flow. Second operand 3 states and 113 transitions. [2024-10-11 14:12:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 44 transitions, 223 flow [2024-10-11 14:12:32,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 44 transitions, 218 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:32,692 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 138 flow [2024-10-11 14:12:32,692 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2024-10-11 14:12:32,693 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2024-10-11 14:12:32,693 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 138 flow [2024-10-11 14:12:32,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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-10-11 14:12:32,693 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:32,693 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 14:12:32,694 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:12:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -451699061, now seen corresponding path program 1 times [2024-10-11 14:12:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829129587] [2024-10-11 14:12:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:32,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:32,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829129587] [2024-10-11 14:12:32,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829129587] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:32,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:32,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:32,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114554252] [2024-10-11 14:12:32,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:32,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:12:32,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:32,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:12:32,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:12:32,852 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-10-11 14:12:32,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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-10-11 14:12:32,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:32,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-10-11 14:12:32,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:33,090 INFO L124 PetriNetUnfolderBase]: 1852/3415 cut-off events. [2024-10-11 14:12:33,091 INFO L125 PetriNetUnfolderBase]: For 861/861 co-relation queries the response was YES. [2024-10-11 14:12:33,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9294 conditions, 3415 events. 1852/3415 cut-off events. For 861/861 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 21513 event pairs, 85 based on Foata normal form. 30/3436 useless extension candidates. Maximal degree in co-relation 9279. Up to 2321 conditions per place. [2024-10-11 14:12:33,109 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 49 selfloop transitions, 9 changer transitions 0/67 dead transitions. [2024-10-11 14:12:33,109 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 384 flow [2024-10-11 14:12:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:12:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:12:33,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2024-10-11 14:12:33,111 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5176056338028169 [2024-10-11 14:12:33,111 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 138 flow. Second operand 4 states and 147 transitions. [2024-10-11 14:12:33,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 384 flow [2024-10-11 14:12:33,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:33,116 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 180 flow [2024-10-11 14:12:33,117 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2024-10-11 14:12:33,118 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2024-10-11 14:12:33,118 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 180 flow [2024-10-11 14:12:33,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 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-10-11 14:12:33,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:33,118 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:33,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 14:12:33,118 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:12:33,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1369866453, now seen corresponding path program 2 times [2024-10-11 14:12:33,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:33,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626249111] [2024-10-11 14:12:33,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:33,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626249111] [2024-10-11 14:12:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626249111] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:12:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936624272] [2024-10-11 14:12:33,212 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:12:33,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:12:33,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:12:33,214 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:12:33,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 14:12:33,289 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:12:33,289 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:12:33,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:12:33,293 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:12:33,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:33,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:12:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:33,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936624272] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:12:33,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:12:33,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-11 14:12:33,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721570199] [2024-10-11 14:12:33,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:12:33,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:12:33,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:33,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:12:33,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:12:33,522 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 71 [2024-10-11 14:12:33,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 180 flow. Second operand has 11 states, 11 states have (on average 25.545454545454547) internal successors, (281), 11 states have internal predecessors, (281), 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-10-11 14:12:33,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:33,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 71 [2024-10-11 14:12:33,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:34,154 INFO L124 PetriNetUnfolderBase]: 4241/7782 cut-off events. [2024-10-11 14:12:34,154 INFO L125 PetriNetUnfolderBase]: For 3073/3073 co-relation queries the response was YES. [2024-10-11 14:12:34,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20213 conditions, 7782 events. 4241/7782 cut-off events. For 3073/3073 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 56392 event pairs, 845 based on Foata normal form. 78/7851 useless extension candidates. Maximal degree in co-relation 20195. Up to 2808 conditions per place. [2024-10-11 14:12:34,205 INFO L140 encePairwiseOnDemand]: 65/71 looper letters, 50 selfloop transitions, 21 changer transitions 0/80 dead transitions. [2024-10-11 14:12:34,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 486 flow [2024-10-11 14:12:34,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:12:34,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:12:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2024-10-11 14:12:34,207 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49014084507042255 [2024-10-11 14:12:34,207 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 180 flow. Second operand 5 states and 174 transitions. [2024-10-11 14:12:34,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 486 flow [2024-10-11 14:12:34,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 80 transitions, 468 flow, removed 4 selfloop flow, removed 2 redundant places. [2024-10-11 14:12:34,212 INFO L231 Difference]: Finished difference. Result has 49 places, 49 transitions, 266 flow [2024-10-11 14:12:34,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=71, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=266, PETRI_PLACES=49, PETRI_TRANSITIONS=49} [2024-10-11 14:12:34,213 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2024-10-11 14:12:34,214 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 49 transitions, 266 flow [2024-10-11 14:12:34,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.545454545454547) internal successors, (281), 11 states have internal predecessors, (281), 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-10-11 14:12:34,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:34,214 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:34,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 14:12:34,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 14:12:34,419 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2024-10-11 14:12:34,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2099183726, now seen corresponding path program 1 times [2024-10-11 14:12:34,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:34,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447824186] [2024-10-11 14:12:34,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:34,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:34,436 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:34,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:34,449 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:34,449 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-10-11 14:12:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-10-11 14:12:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2024-10-11 14:12:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-10-11 14:12:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-10-11 14:12:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-10-11 14:12:34,450 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-10-11 14:12:34,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 14:12:34,450 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-10-11 14:12:34,451 WARN L239 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:34,451 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-10-11 14:12:34,478 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:34,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 87 transitions, 254 flow [2024-10-11 14:12:34,485 INFO L124 PetriNetUnfolderBase]: 7/60 cut-off events. [2024-10-11 14:12:34,485 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-11 14:12:34,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 60 events. 7/60 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 82. Up to 6 conditions per place. [2024-10-11 14:12:34,485 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 87 transitions, 254 flow [2024-10-11 14:12:34,486 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 46 transitions, 135 flow [2024-10-11 14:12:34,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:34,487 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;@4344a977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:34,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-10-11 14:12:34,488 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:34,488 INFO L124 PetriNetUnfolderBase]: 2/20 cut-off events. [2024-10-11 14:12:34,488 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-11 14:12:34,488 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:34,488 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:34,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 14:12:34,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:34,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1009763840, now seen corresponding path program 1 times [2024-10-11 14:12:34,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:34,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278090184] [2024-10-11 14:12:34,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:34,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:34,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:34,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:34,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278090184] [2024-10-11 14:12:34,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278090184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:34,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:34,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:34,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537911572] [2024-10-11 14:12:34,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:34,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:34,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:34,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:34,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:34,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 87 [2024-10-11 14:12:34,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-10-11 14:12:34,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:34,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 87 [2024-10-11 14:12:34,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:42,259 INFO L124 PetriNetUnfolderBase]: 91293/108940 cut-off events. [2024-10-11 14:12:42,259 INFO L125 PetriNetUnfolderBase]: For 19847/19847 co-relation queries the response was YES. [2024-10-11 14:12:42,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 225254 conditions, 108940 events. 91293/108940 cut-off events. For 19847/19847 co-relation queries the response was YES. Maximal size of possible extension queue 3086. Compared 506563 event pairs, 21477 based on Foata normal form. 12797/121574 useless extension candidates. Maximal degree in co-relation 225240. Up to 105970 conditions per place. [2024-10-11 14:12:43,051 INFO L140 encePairwiseOnDemand]: 72/87 looper letters, 40 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2024-10-11 14:12:43,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 279 flow [2024-10-11 14:12:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:43,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2024-10-11 14:12:43,053 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5478927203065134 [2024-10-11 14:12:43,053 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 135 flow. Second operand 3 states and 143 transitions. [2024-10-11 14:12:43,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 279 flow [2024-10-11 14:12:43,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 56 transitions, 254 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:43,062 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 146 flow [2024-10-11 14:12:43,062 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2024-10-11 14:12:43,063 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2024-10-11 14:12:43,063 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 146 flow [2024-10-11 14:12:43,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-10-11 14:12:43,063 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:43,063 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 14:12:43,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 14:12:43,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:43,064 INFO L85 PathProgramCache]: Analyzing trace with hash -629066721, now seen corresponding path program 1 times [2024-10-11 14:12:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:43,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364640915] [2024-10-11 14:12:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:43,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:43,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364640915] [2024-10-11 14:12:43,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364640915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:43,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096658559] [2024-10-11 14:12:43,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:43,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:43,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:43,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:43,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:43,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 87 [2024-10-11 14:12:43,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10-11 14:12:43,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:43,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 87 [2024-10-11 14:12:43,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:43,640 INFO L124 PetriNetUnfolderBase]: 2865/5388 cut-off events. [2024-10-11 14:12:43,641 INFO L125 PetriNetUnfolderBase]: For 1183/1183 co-relation queries the response was YES. [2024-10-11 14:12:43,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12181 conditions, 5388 events. 2865/5388 cut-off events. For 1183/1183 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 36324 event pairs, 523 based on Foata normal form. 7138/12463 useless extension candidates. Maximal degree in co-relation 12165. Up to 3714 conditions per place. [2024-10-11 14:12:43,665 INFO L140 encePairwiseOnDemand]: 75/87 looper letters, 28 selfloop transitions, 12 changer transitions 0/51 dead transitions. [2024-10-11 14:12:43,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 51 transitions, 265 flow [2024-10-11 14:12:43,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 14:12:43,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 14:12:43,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2024-10-11 14:12:43,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.524904214559387 [2024-10-11 14:12:43,667 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 146 flow. Second operand 3 states and 137 transitions. [2024-10-11 14:12:43,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 51 transitions, 265 flow [2024-10-11 14:12:43,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:43,669 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 164 flow [2024-10-11 14:12:43,669 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2024-10-11 14:12:43,670 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -4 predicate places. [2024-10-11 14:12:43,670 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 164 flow [2024-10-11 14:12:43,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 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-10-11 14:12:43,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:43,670 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:43,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 14:12:43,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 14:12:43,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:43,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1984883800, now seen corresponding path program 1 times [2024-10-11 14:12:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:43,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764111180] [2024-10-11 14:12:43,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:43,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:43,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:43,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:43,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764111180] [2024-10-11 14:12:43,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764111180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:43,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:43,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 14:12:43,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074782299] [2024-10-11 14:12:43,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:43,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 14:12:43,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:43,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 14:12:43,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 14:12:43,724 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 87 [2024-10-11 14:12:43,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-10-11 14:12:43,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:43,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 87 [2024-10-11 14:12:43,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:44,135 INFO L124 PetriNetUnfolderBase]: 4277/7650 cut-off events. [2024-10-11 14:12:44,136 INFO L125 PetriNetUnfolderBase]: For 1831/1831 co-relation queries the response was YES. [2024-10-11 14:12:44,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21010 conditions, 7650 events. 4277/7650 cut-off events. For 1831/1831 co-relation queries the response was YES. Maximal size of possible extension queue 360. Compared 52787 event pairs, 161 based on Foata normal form. 45/7684 useless extension candidates. Maximal degree in co-relation 20994. Up to 5809 conditions per place. [2024-10-11 14:12:44,182 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 58 selfloop transitions, 11 changer transitions 0/79 dead transitions. [2024-10-11 14:12:44,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 79 transitions, 462 flow [2024-10-11 14:12:44,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 14:12:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 14:12:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-10-11 14:12:44,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5114942528735632 [2024-10-11 14:12:44,184 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 164 flow. Second operand 4 states and 178 transitions. [2024-10-11 14:12:44,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 79 transitions, 462 flow [2024-10-11 14:12:44,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 79 transitions, 431 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 14:12:44,193 INFO L231 Difference]: Finished difference. Result has 52 places, 48 transitions, 216 flow [2024-10-11 14:12:44,193 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=216, PETRI_PLACES=52, PETRI_TRANSITIONS=48} [2024-10-11 14:12:44,194 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2024-10-11 14:12:44,194 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 48 transitions, 216 flow [2024-10-11 14:12:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 4 states have internal predecessors, (118), 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-10-11 14:12:44,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:44,194 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:44,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 14:12:44,195 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 14:12:44,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1401267010, now seen corresponding path program 2 times [2024-10-11 14:12:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591464386] [2024-10-11 14:12:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:44,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:44,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591464386] [2024-10-11 14:12:44,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591464386] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:12:44,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049197186] [2024-10-11 14:12:44,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 14:12:44,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:12:44,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:12:44,277 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:12:44,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 14:12:44,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 14:12:44,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:12:44,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 14:12:44,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:12:44,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:44,431 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:12:44,481 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:44,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049197186] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:12:44,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:12:44,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2024-10-11 14:12:44,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820664498] [2024-10-11 14:12:44,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:12:44,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 14:12:44,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:44,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 14:12:44,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 14:12:44,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 87 [2024-10-11 14:12:44,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 48 transitions, 216 flow. Second operand has 11 states, 11 states have (on average 30.545454545454547) internal successors, (336), 11 states have internal predecessors, (336), 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-10-11 14:12:44,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:44,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 87 [2024-10-11 14:12:44,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:45,985 INFO L124 PetriNetUnfolderBase]: 10517/18749 cut-off events. [2024-10-11 14:12:45,985 INFO L125 PetriNetUnfolderBase]: For 7613/7613 co-relation queries the response was YES. [2024-10-11 14:12:46,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48834 conditions, 18749 events. 10517/18749 cut-off events. For 7613/7613 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 150078 event pairs, 2009 based on Foata normal form. 171/18907 useless extension candidates. Maximal degree in co-relation 48815. Up to 6579 conditions per place. [2024-10-11 14:12:46,099 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 59 selfloop transitions, 26 changer transitions 0/95 dead transitions. [2024-10-11 14:12:46,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 95 transitions, 588 flow [2024-10-11 14:12:46,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 14:12:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 14:12:46,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2024-10-11 14:12:46,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4850574712643678 [2024-10-11 14:12:46,101 INFO L175 Difference]: Start difference. First operand has 52 places, 48 transitions, 216 flow. Second operand 5 states and 211 transitions. [2024-10-11 14:12:46,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 95 transitions, 588 flow [2024-10-11 14:12:46,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 566 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-10-11 14:12:46,108 INFO L231 Difference]: Finished difference. Result has 55 places, 58 transitions, 323 flow [2024-10-11 14:12:46,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=55, PETRI_TRANSITIONS=58} [2024-10-11 14:12:46,108 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2024-10-11 14:12:46,108 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 58 transitions, 323 flow [2024-10-11 14:12:46,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.545454545454547) internal successors, (336), 11 states have internal predecessors, (336), 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-10-11 14:12:46,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:46,109 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:46,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 14:12:46,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 14:12:46,311 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 14:12:46,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1971800728, now seen corresponding path program 3 times [2024-10-11 14:12:46,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110553561] [2024-10-11 14:12:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110553561] [2024-10-11 14:12:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110553561] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 14:12:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035508237] [2024-10-11 14:12:46,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 14:12:46,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:12:46,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 14:12:46,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 14:12:46,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 14:12:46,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-11 14:12:46,490 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 14:12:46,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 14:12:46,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 14:12:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:46,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 14:12:46,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:46,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035508237] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 14:12:46,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 14:12:46,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-10-11 14:12:46,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280774497] [2024-10-11 14:12:46,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 14:12:46,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 14:12:46,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:46,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 14:12:46,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 14:12:46,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2024-10-11 14:12:46,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 58 transitions, 323 flow. Second operand has 12 states, 12 states have (on average 26.0) internal successors, (312), 12 states have internal predecessors, (312), 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-10-11 14:12:46,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:46,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2024-10-11 14:12:46,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 14:12:48,423 INFO L124 PetriNetUnfolderBase]: 10826/18343 cut-off events. [2024-10-11 14:12:48,423 INFO L125 PetriNetUnfolderBase]: For 15172/15172 co-relation queries the response was YES. [2024-10-11 14:12:48,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51477 conditions, 18343 events. 10826/18343 cut-off events. For 15172/15172 co-relation queries the response was YES. Maximal size of possible extension queue 718. Compared 136108 event pairs, 178 based on Foata normal form. 342/18675 useless extension candidates. Maximal degree in co-relation 51457. Up to 5808 conditions per place. [2024-10-11 14:12:48,545 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 93 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-10-11 14:12:48,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 127 transitions, 816 flow [2024-10-11 14:12:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 14:12:48,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-11 14:12:48,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 275 transitions. [2024-10-11 14:12:48,546 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.451559934318555 [2024-10-11 14:12:48,546 INFO L175 Difference]: Start difference. First operand has 55 places, 58 transitions, 323 flow. Second operand 7 states and 275 transitions. [2024-10-11 14:12:48,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 127 transitions, 816 flow [2024-10-11 14:12:48,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 127 transitions, 760 flow, removed 20 selfloop flow, removed 2 redundant places. [2024-10-11 14:12:48,607 INFO L231 Difference]: Finished difference. Result has 57 places, 56 transitions, 309 flow [2024-10-11 14:12:48,607 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=309, PETRI_PLACES=57, PETRI_TRANSITIONS=56} [2024-10-11 14:12:48,608 INFO L277 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2024-10-11 14:12:48,608 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 56 transitions, 309 flow [2024-10-11 14:12:48,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 26.0) internal successors, (312), 12 states have internal predecessors, (312), 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-10-11 14:12:48,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:48,609 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:48,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 14:12:48,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 14:12:48,813 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2024-10-11 14:12:48,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:48,813 INFO L85 PathProgramCache]: Analyzing trace with hash -2126999426, now seen corresponding path program 1 times [2024-10-11 14:12:48,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:48,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124720504] [2024-10-11 14:12:48,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:48,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:48,826 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 14:12:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 14:12:48,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 14:12:48,836 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 14:12:48,836 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2024-10-11 14:12:48,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2024-10-11 14:12:48,836 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2024-10-11 14:12:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2024-10-11 14:12:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2024-10-11 14:12:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2024-10-11 14:12:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2024-10-11 14:12:48,837 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2024-10-11 14:12:48,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 14:12:48,837 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-10-11 14:12:48,837 WARN L239 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-11 14:12:48,837 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-10-11 14:12:48,866 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 14:12:48,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 103 transitions, 314 flow [2024-10-11 14:12:48,873 INFO L124 PetriNetUnfolderBase]: 8/69 cut-off events. [2024-10-11 14:12:48,873 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-10-11 14:12:48,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 69 events. 8/69 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 98. Up to 7 conditions per place. [2024-10-11 14:12:48,873 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 103 transitions, 314 flow [2024-10-11 14:12:48,874 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 52 transitions, 161 flow [2024-10-11 14:12:48,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 14:12:48,875 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;@4344a977, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 14:12:48,876 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-10-11 14:12:48,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 14:12:48,877 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2024-10-11 14:12:48,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 14:12:48,877 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 14:12:48,877 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 14:12:48,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2024-10-11 14:12:48,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 14:12:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1397489739, now seen corresponding path program 1 times [2024-10-11 14:12:48,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 14:12:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730641635] [2024-10-11 14:12:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 14:12:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 14:12:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 14:12:48,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 14:12:48,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 14:12:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730641635] [2024-10-11 14:12:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730641635] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 14:12:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 14:12:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 14:12:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709530039] [2024-10-11 14:12:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 14:12:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 14:12:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 14:12:48,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 14:12:48,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 14:12:48,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 103 [2024-10-11 14:12:48,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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-10-11 14:12:48,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 14:12:48,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 103 [2024-10-11 14:12:48,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand