./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:08:21,582 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:08:21,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:08:21,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:08:21,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:08:21,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:08:21,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:08:21,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:08:21,667 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:08:21,668 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:08:21,668 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:08:21,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:08:21,669 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:08:21,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:08:21,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:08:21,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:08:21,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:08:21,670 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:08:21,670 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:08:21,670 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:08:21,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:08:21,673 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:08:21,674 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:08:21,674 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:08:21,674 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:08:21,674 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:08:21,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:08:21,674 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:08:21,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:08:21,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:08:21,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:08:21,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:08:21,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:08:21,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:08:21,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:08:21,678 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:08:21,678 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2024-11-16 19:08:21,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:08:21,900 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:08:21,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:08:21,904 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:08:21,904 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:08:21,905 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2024-11-16 19:08:23,160 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:08:23,336 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:08:23,337 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2024-11-16 19:08:23,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4102bb3da/08768cd698aa47cdb4007928e40e83d7/FLAGb99488707 [2024-11-16 19:08:23,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4102bb3da/08768cd698aa47cdb4007928e40e83d7 [2024-11-16 19:08:23,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:08:23,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:08:23,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:08:23,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:08:23,365 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:08:23,366 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,366 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40ae8a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23, skipping insertion in model container [2024-11-16 19:08:23,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:08:23,730 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i[30633,30646] [2024-11-16 19:08:23,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:08:23,745 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:08:23,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i[30633,30646] [2024-11-16 19:08:23,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:08:23,811 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:08:23,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23 WrapperNode [2024-11-16 19:08:23,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:08:23,813 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:08:23,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:08:23,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:08:23,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,832 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,848 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-16 19:08:23,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:08:23,849 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:08:23,849 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:08:23,849 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:08:23,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:08:23,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,879 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,880 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,881 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:08:23,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:08:23,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:08:23,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:08:23,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (1/1) ... [2024-11-16 19:08:23,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:08:23,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:08:23,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 19:08:23,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 19:08:23,958 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-16 19:08:23,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-16 19:08:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 19:08:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:08:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:08:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 19:08:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:08:23,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:08:23,961 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:08:24,068 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:08:24,070 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:08:24,159 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:08:24,159 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:08:24,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:08:24,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:08:24,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:08:24 BoogieIcfgContainer [2024-11-16 19:08:24,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:08:24,218 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:08:24,218 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:08:24,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:08:24,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:08:23" (1/3) ... [2024-11-16 19:08:24,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55098f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:08:24, skipping insertion in model container [2024-11-16 19:08:24,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:08:23" (2/3) ... [2024-11-16 19:08:24,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55098f89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:08:24, skipping insertion in model container [2024-11-16 19:08:24,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:08:24" (3/3) ... [2024-11-16 19:08:24,223 INFO L112 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2024-11-16 19:08:24,235 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:08:24,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:08:24,235 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:08:24,259 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:08:24,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 15 places, 13 transitions, 30 flow [2024-11-16 19:08:24,305 INFO L124 PetriNetUnfolderBase]: 2/18 cut-off events. [2024-11-16 19:08:24,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:08:24,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 18 events. 2/18 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 0 based on Foata normal form. 0/13 useless extension candidates. Maximal degree in co-relation 10. Up to 4 conditions per place. [2024-11-16 19:08:24,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 15 places, 13 transitions, 30 flow [2024-11-16 19:08:24,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 15 places, 13 transitions, 30 flow [2024-11-16 19:08:24,323 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:08:24,328 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;@23c3bd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:08:24,329 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-16 19:08:24,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:08:24,333 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2024-11-16 19:08:24,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 19:08:24,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:24,334 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2024-11-16 19:08:24,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 19:08:24,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:24,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1338816374, now seen corresponding path program 1 times [2024-11-16 19:08:24,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:24,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381273454] [2024-11-16 19:08:24,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:24,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:08:24,439 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:08:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:08:24,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:08:24,467 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:08:24,468 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-16 19:08:24,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-16 19:08:24,470 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-11-16 19:08:24,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:08:24,470 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-11-16 19:08:24,473 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 19:08:24,473 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-16 19:08:24,484 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:08:24,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 23 places, 19 transitions, 48 flow [2024-11-16 19:08:24,491 INFO L124 PetriNetUnfolderBase]: 3/29 cut-off events. [2024-11-16 19:08:24,491 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 19:08:24,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 29 events. 3/29 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 52 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 6 conditions per place. [2024-11-16 19:08:24,492 INFO L82 GeneralOperation]: Start removeDead. Operand has 23 places, 19 transitions, 48 flow [2024-11-16 19:08:24,495 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 19 transitions, 48 flow [2024-11-16 19:08:24,496 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:08:24,497 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;@23c3bd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:08:24,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-16 19:08:24,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:08:24,505 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2024-11-16 19:08:24,505 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:08:24,505 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:24,505 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:24,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:08:24,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1093871946, now seen corresponding path program 1 times [2024-11-16 19:08:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668950345] [2024-11-16 19:08:24,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:24,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:08:24,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:24,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668950345] [2024-11-16 19:08:24,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668950345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:24,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:24,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:08:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618418934] [2024-11-16 19:08:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:24,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:08:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:24,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:08:24,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:08:24,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 19 [2024-11-16 19:08:24,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 19 transitions, 48 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:24,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:24,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 19 [2024-11-16 19:08:24,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:24,739 INFO L124 PetriNetUnfolderBase]: 109/219 cut-off events. [2024-11-16 19:08:24,740 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-16 19:08:24,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 219 events. 109/219 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 942 event pairs, 45 based on Foata normal form. 52/245 useless extension candidates. Maximal degree in co-relation 329. Up to 116 conditions per place. [2024-11-16 19:08:24,744 INFO L140 encePairwiseOnDemand]: 13/19 looper letters, 20 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2024-11-16 19:08:24,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 25 transitions, 111 flow [2024-11-16 19:08:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:08:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:08:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2024-11-16 19:08:24,753 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5964912280701754 [2024-11-16 19:08:24,754 INFO L175 Difference]: Start difference. First operand has 23 places, 19 transitions, 48 flow. Second operand 3 states and 34 transitions. [2024-11-16 19:08:24,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 25 transitions, 111 flow [2024-11-16 19:08:24,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 25 transitions, 111 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:08:24,758 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 64 flow [2024-11-16 19:08:24,759 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=19, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2024-11-16 19:08:24,763 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-11-16 19:08:24,763 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 64 flow [2024-11-16 19:08:24,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:24,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:24,763 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1] [2024-11-16 19:08:24,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:08:24,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-11-16 19:08:24,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:24,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1891685511, now seen corresponding path program 1 times [2024-11-16 19:08:24,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:24,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587538294] [2024-11-16 19:08:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:08:24,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:08:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:08:24,800 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:08:24,802 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:08:24,802 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 4 remaining) [2024-11-16 19:08:24,802 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2024-11-16 19:08:24,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2024-11-16 19:08:24,803 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2024-11-16 19:08:24,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:08:24,803 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 19:08:24,804 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 19:08:24,804 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-16 19:08:24,825 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:08:24,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 25 transitions, 68 flow [2024-11-16 19:08:24,836 INFO L124 PetriNetUnfolderBase]: 4/40 cut-off events. [2024-11-16 19:08:24,836 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 19:08:24,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 40 events. 4/40 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 0 based on Foata normal form. 0/29 useless extension candidates. Maximal degree in co-relation 35. Up to 8 conditions per place. [2024-11-16 19:08:24,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 25 transitions, 68 flow [2024-11-16 19:08:24,837 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 25 transitions, 68 flow [2024-11-16 19:08:24,838 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:08:24,839 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;@23c3bd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:08:24,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-16 19:08:24,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:08:24,845 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2024-11-16 19:08:24,845 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:08:24,845 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:24,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:24,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:08:24,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:24,846 INFO L85 PathProgramCache]: Analyzing trace with hash 358618954, now seen corresponding path program 1 times [2024-11-16 19:08:24,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:24,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498480720] [2024-11-16 19:08:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:24,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:24,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:08:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498480720] [2024-11-16 19:08:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498480720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:24,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:24,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:08:24,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201978469] [2024-11-16 19:08:24,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:24,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:08:24,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:24,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:08:24,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:08:24,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2024-11-16 19:08:24,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:24,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:24,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2024-11-16 19:08:24,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:25,097 INFO L124 PetriNetUnfolderBase]: 1343/2085 cut-off events. [2024-11-16 19:08:25,098 INFO L125 PetriNetUnfolderBase]: For 310/310 co-relation queries the response was YES. [2024-11-16 19:08:25,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4354 conditions, 2085 events. 1343/2085 cut-off events. For 310/310 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11265 event pairs, 681 based on Foata normal form. 360/2139 useless extension candidates. Maximal degree in co-relation 1793. Up to 1272 conditions per place. [2024-11-16 19:08:25,121 INFO L140 encePairwiseOnDemand]: 18/25 looper letters, 31 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2024-11-16 19:08:25,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 174 flow [2024-11-16 19:08:25,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:08:25,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:08:25,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2024-11-16 19:08:25,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2024-11-16 19:08:25,123 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 68 flow. Second operand 3 states and 46 transitions. [2024-11-16 19:08:25,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 174 flow [2024-11-16 19:08:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 37 transitions, 170 flow, removed 2 selfloop flow, removed 0 redundant places. [2024-11-16 19:08:25,126 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 90 flow [2024-11-16 19:08:25,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2024-11-16 19:08:25,128 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 2 predicate places. [2024-11-16 19:08:25,128 INFO L471 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 90 flow [2024-11-16 19:08:25,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:25,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:25,128 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:25,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:08:25,129 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:08:25,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:25,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1764364279, now seen corresponding path program 1 times [2024-11-16 19:08:25,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:25,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679374596] [2024-11-16 19:08:25,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:25,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:25,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:08:25,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:25,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679374596] [2024-11-16 19:08:25,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679374596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:25,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:25,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:08:25,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996294294] [2024-11-16 19:08:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:25,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:08:25,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:25,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:08:25,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:08:25,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2024-11-16 19:08:25,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:25,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:25,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2024-11-16 19:08:25,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:25,418 INFO L124 PetriNetUnfolderBase]: 1689/2672 cut-off events. [2024-11-16 19:08:25,418 INFO L125 PetriNetUnfolderBase]: For 1086/1086 co-relation queries the response was YES. [2024-11-16 19:08:25,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6353 conditions, 2672 events. 1689/2672 cut-off events. For 1086/1086 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 15418 event pairs, 787 based on Foata normal form. 0/2422 useless extension candidates. Maximal degree in co-relation 2981. Up to 1546 conditions per place. [2024-11-16 19:08:25,434 INFO L140 encePairwiseOnDemand]: 20/25 looper letters, 33 selfloop transitions, 6 changer transitions 0/41 dead transitions. [2024-11-16 19:08:25,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 223 flow [2024-11-16 19:08:25,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:08:25,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:08:25,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2024-11-16 19:08:25,436 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5466666666666666 [2024-11-16 19:08:25,436 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 90 flow. Second operand 3 states and 41 transitions. [2024-11-16 19:08:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 223 flow [2024-11-16 19:08:25,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:08:25,444 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 130 flow [2024-11-16 19:08:25,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2024-11-16 19:08:25,446 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2024-11-16 19:08:25,446 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 130 flow [2024-11-16 19:08:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:25,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:25,447 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:25,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:08:25,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:08:25,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1305072301, now seen corresponding path program 1 times [2024-11-16 19:08:25,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79688105] [2024-11-16 19:08:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:08:25,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:25,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79688105] [2024-11-16 19:08:25,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79688105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:25,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:25,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:08:25,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608486149] [2024-11-16 19:08:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:25,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:08:25,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:08:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:08:25,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2024-11-16 19:08:25,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:25,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:25,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2024-11-16 19:08:25,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:25,885 INFO L124 PetriNetUnfolderBase]: 2811/4434 cut-off events. [2024-11-16 19:08:25,885 INFO L125 PetriNetUnfolderBase]: For 2671/2671 co-relation queries the response was YES. [2024-11-16 19:08:25,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11721 conditions, 4434 events. 2811/4434 cut-off events. For 2671/2671 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 28978 event pairs, 435 based on Foata normal form. 42/4064 useless extension candidates. Maximal degree in co-relation 11643. Up to 1504 conditions per place. [2024-11-16 19:08:25,914 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 69 selfloop transitions, 18 changer transitions 0/89 dead transitions. [2024-11-16 19:08:25,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 89 transitions, 548 flow [2024-11-16 19:08:25,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:08:25,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:08:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2024-11-16 19:08:25,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6 [2024-11-16 19:08:25,915 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 130 flow. Second operand 6 states and 90 transitions. [2024-11-16 19:08:25,916 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 89 transitions, 548 flow [2024-11-16 19:08:25,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 89 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:08:25,926 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 277 flow [2024-11-16 19:08:25,926 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=277, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2024-11-16 19:08:25,927 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2024-11-16 19:08:25,927 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 277 flow [2024-11-16 19:08:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:25,927 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:25,927 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 19:08:25,927 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:08:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:25,928 INFO L85 PathProgramCache]: Analyzing trace with hash -958189741, now seen corresponding path program 2 times [2024-11-16 19:08:25,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:25,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880516148] [2024-11-16 19:08:25,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:25,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:08:25,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:25,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880516148] [2024-11-16 19:08:25,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880516148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:25,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:25,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:08:25,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072723308] [2024-11-16 19:08:25,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:25,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:08:25,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:25,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:08:25,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:08:25,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 25 [2024-11-16 19:08:25,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 277 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:25,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:25,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 25 [2024-11-16 19:08:25,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:26,383 INFO L124 PetriNetUnfolderBase]: 2981/4761 cut-off events. [2024-11-16 19:08:26,384 INFO L125 PetriNetUnfolderBase]: For 5804/5804 co-relation queries the response was YES. [2024-11-16 19:08:26,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14259 conditions, 4761 events. 2981/4761 cut-off events. For 5804/5804 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 32114 event pairs, 321 based on Foata normal form. 84/4525 useless extension candidates. Maximal degree in co-relation 7317. Up to 1726 conditions per place. [2024-11-16 19:08:26,426 INFO L140 encePairwiseOnDemand]: 16/25 looper letters, 76 selfloop transitions, 27 changer transitions 0/105 dead transitions. [2024-11-16 19:08:26,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 105 transitions, 756 flow [2024-11-16 19:08:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:08:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:08:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2024-11-16 19:08:26,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5657142857142857 [2024-11-16 19:08:26,428 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 277 flow. Second operand 7 states and 99 transitions. [2024-11-16 19:08:26,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 105 transitions, 756 flow [2024-11-16 19:08:26,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 105 transitions, 756 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:08:26,437 INFO L231 Difference]: Finished difference. Result has 52 places, 57 transitions, 509 flow [2024-11-16 19:08:26,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=509, PETRI_PLACES=52, PETRI_TRANSITIONS=57} [2024-11-16 19:08:26,437 INFO L277 CegarLoopForPetriNet]: 31 programPoint places, 21 predicate places. [2024-11-16 19:08:26,438 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 509 flow [2024-11-16 19:08:26,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:26,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:26,438 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1] [2024-11-16 19:08:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 19:08:26,438 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-16 19:08:26,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash -50658475, now seen corresponding path program 1 times [2024-11-16 19:08:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507297184] [2024-11-16 19:08:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:08:26,446 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 19:08:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 19:08:26,451 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 19:08:26,451 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 19:08:26,451 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2024-11-16 19:08:26,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-16 19:08:26,451 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-16 19:08:26,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-16 19:08:26,452 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2024-11-16 19:08:26,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:08:26,452 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2024-11-16 19:08:26,452 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-16 19:08:26,452 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-16 19:08:26,467 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-16 19:08:26,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 39 places, 31 transitions, 90 flow [2024-11-16 19:08:26,473 INFO L124 PetriNetUnfolderBase]: 5/51 cut-off events. [2024-11-16 19:08:26,473 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-16 19:08:26,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70 conditions, 51 events. 5/51 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 86 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 51. Up to 10 conditions per place. [2024-11-16 19:08:26,473 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 31 transitions, 90 flow [2024-11-16 19:08:26,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 31 transitions, 90 flow [2024-11-16 19:08:26,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:08:26,475 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;@23c3bd5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:08:26,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-11-16 19:08:26,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:08:26,476 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2024-11-16 19:08:26,477 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-16 19:08:26,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:26,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:26,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:26,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:26,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1276296951, now seen corresponding path program 1 times [2024-11-16 19:08:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:26,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883603430] [2024-11-16 19:08:26,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:26,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:26,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:08:26,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:26,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883603430] [2024-11-16 19:08:26,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883603430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:26,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:26,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:08:26,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094529121] [2024-11-16 19:08:26,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:26,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:08:26,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:26,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:08:26,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:08:26,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:26,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:26,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:26,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:26,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:27,444 INFO L124 PetriNetUnfolderBase]: 12243/16984 cut-off events. [2024-11-16 19:08:27,445 INFO L125 PetriNetUnfolderBase]: For 3879/3879 co-relation queries the response was YES. [2024-11-16 19:08:27,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35518 conditions, 16984 events. 12243/16984 cut-off events. For 3879/3879 co-relation queries the response was YES. Maximal size of possible extension queue 841. Compared 100310 event pairs, 6745 based on Foata normal form. 2272/16590 useless extension candidates. Maximal degree in co-relation 4340. Up to 10936 conditions per place. [2024-11-16 19:08:27,534 INFO L140 encePairwiseOnDemand]: 23/31 looper letters, 42 selfloop transitions, 5 changer transitions 0/49 dead transitions. [2024-11-16 19:08:27,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 241 flow [2024-11-16 19:08:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:08:27,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:08:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2024-11-16 19:08:27,538 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6236559139784946 [2024-11-16 19:08:27,538 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 90 flow. Second operand 3 states and 58 transitions. [2024-11-16 19:08:27,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 241 flow [2024-11-16 19:08:27,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 49 transitions, 229 flow, removed 6 selfloop flow, removed 0 redundant places. [2024-11-16 19:08:27,542 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 116 flow [2024-11-16 19:08:27,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2024-11-16 19:08:27,545 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 2 predicate places. [2024-11-16 19:08:27,545 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 116 flow [2024-11-16 19:08:27,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:27,546 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:27,547 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:08:27,548 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 766047452, now seen corresponding path program 1 times [2024-11-16 19:08:27,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:27,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369086910] [2024-11-16 19:08:27,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:27,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:08:27,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:27,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369086910] [2024-11-16 19:08:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369086910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:27,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:27,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:08:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936280771] [2024-11-16 19:08:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:27,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:08:27,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:27,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:08:27,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:08:27,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:27,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:27,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:27,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:27,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:28,830 INFO L124 PetriNetUnfolderBase]: 16953/23601 cut-off events. [2024-11-16 19:08:28,830 INFO L125 PetriNetUnfolderBase]: For 9767/9767 co-relation queries the response was YES. [2024-11-16 19:08:28,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56027 conditions, 23601 events. 16953/23601 cut-off events. For 9767/9767 co-relation queries the response was YES. Maximal size of possible extension queue 1223. Compared 147459 event pairs, 8455 based on Foata normal form. 0/20831 useless extension candidates. Maximal degree in co-relation 26321. Up to 15062 conditions per place. [2024-11-16 19:08:28,945 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 45 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2024-11-16 19:08:28,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 302 flow [2024-11-16 19:08:28,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:08:28,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:08:28,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2024-11-16 19:08:28,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5698924731182796 [2024-11-16 19:08:28,946 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 116 flow. Second operand 3 states and 53 transitions. [2024-11-16 19:08:28,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 302 flow [2024-11-16 19:08:28,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:08:28,987 INFO L231 Difference]: Finished difference. Result has 43 places, 38 transitions, 174 flow [2024-11-16 19:08:28,987 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=43, PETRI_TRANSITIONS=38} [2024-11-16 19:08:28,988 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2024-11-16 19:08:28,988 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 174 flow [2024-11-16 19:08:28,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:28,988 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:28,988 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:28,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 19:08:28,989 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:28,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:28,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1385132408, now seen corresponding path program 1 times [2024-11-16 19:08:28,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:28,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865102538] [2024-11-16 19:08:28,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:28,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:28,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 19:08:29,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:29,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865102538] [2024-11-16 19:08:29,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865102538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:29,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:29,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:08:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341972218] [2024-11-16 19:08:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:29,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:08:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:29,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:08:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:08:29,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:29,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:29,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:29,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:29,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:31,116 INFO L124 PetriNetUnfolderBase]: 28929/40235 cut-off events. [2024-11-16 19:08:31,116 INFO L125 PetriNetUnfolderBase]: For 25144/25144 co-relation queries the response was YES. [2024-11-16 19:08:31,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105823 conditions, 40235 events. 28929/40235 cut-off events. For 25144/25144 co-relation queries the response was YES. Maximal size of possible extension queue 2218. Compared 276710 event pairs, 3557 based on Foata normal form. 258/35777 useless extension candidates. Maximal degree in co-relation 105732. Up to 12558 conditions per place. [2024-11-16 19:08:31,354 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 99 selfloop transitions, 23 changer transitions 0/124 dead transitions. [2024-11-16 19:08:31,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 124 transitions, 764 flow [2024-11-16 19:08:31,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:08:31,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:08:31,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 120 transitions. [2024-11-16 19:08:31,357 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6451612903225806 [2024-11-16 19:08:31,357 INFO L175 Difference]: Start difference. First operand has 43 places, 38 transitions, 174 flow. Second operand 6 states and 120 transitions. [2024-11-16 19:08:31,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 124 transitions, 764 flow [2024-11-16 19:08:31,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 124 transitions, 720 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:08:31,541 INFO L231 Difference]: Finished difference. Result has 50 places, 55 transitions, 357 flow [2024-11-16 19:08:31,541 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=357, PETRI_PLACES=50, PETRI_TRANSITIONS=55} [2024-11-16 19:08:31,542 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 11 predicate places. [2024-11-16 19:08:31,542 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 357 flow [2024-11-16 19:08:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:31,542 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:31,542 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:31,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 19:08:31,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:31,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:31,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1732014968, now seen corresponding path program 2 times [2024-11-16 19:08:31,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:31,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174659518] [2024-11-16 19:08:31,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:31,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:31,592 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:08:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174659518] [2024-11-16 19:08:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174659518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:31,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:08:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858357647] [2024-11-16 19:08:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:08:31,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:31,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:08:31,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:08:31,594 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:31,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 357 flow. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:31,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:31,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:31,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:34,294 INFO L124 PetriNetUnfolderBase]: 31637/44313 cut-off events. [2024-11-16 19:08:34,294 INFO L125 PetriNetUnfolderBase]: For 51974/51974 co-relation queries the response was YES. [2024-11-16 19:08:34,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130260 conditions, 44313 events. 31637/44313 cut-off events. For 51974/51974 co-relation queries the response was YES. Maximal size of possible extension queue 2513. Compared 314810 event pairs, 2741 based on Foata normal form. 516/40669 useless extension candidates. Maximal degree in co-relation 68777. Up to 13974 conditions per place. [2024-11-16 19:08:34,553 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 112 selfloop transitions, 36 changer transitions 0/150 dead transitions. [2024-11-16 19:08:34,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 150 transitions, 1069 flow [2024-11-16 19:08:34,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:08:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:08:34,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 135 transitions. [2024-11-16 19:08:34,556 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6221198156682027 [2024-11-16 19:08:34,556 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 357 flow. Second operand 7 states and 135 transitions. [2024-11-16 19:08:34,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 150 transitions, 1069 flow [2024-11-16 19:08:34,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 150 transitions, 1069 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:08:34,714 INFO L231 Difference]: Finished difference. Result has 60 places, 74 transitions, 673 flow [2024-11-16 19:08:34,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=673, PETRI_PLACES=60, PETRI_TRANSITIONS=74} [2024-11-16 19:08:34,714 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 21 predicate places. [2024-11-16 19:08:34,714 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 74 transitions, 673 flow [2024-11-16 19:08:34,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:34,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:34,715 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:34,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 19:08:34,715 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:34,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:34,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1593544670, now seen corresponding path program 1 times [2024-11-16 19:08:34,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:34,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708327251] [2024-11-16 19:08:34,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:34,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:34,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 19:08:34,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:34,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708327251] [2024-11-16 19:08:34,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708327251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:34,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:34,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:08:34,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243732488] [2024-11-16 19:08:34,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:34,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:08:34,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:34,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:08:34,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:08:34,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:34,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 74 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:34,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:34,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:34,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:38,714 INFO L124 PetriNetUnfolderBase]: 41715/59374 cut-off events. [2024-11-16 19:08:38,714 INFO L125 PetriNetUnfolderBase]: For 167880/167880 co-relation queries the response was YES. [2024-11-16 19:08:38,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193565 conditions, 59374 events. 41715/59374 cut-off events. For 167880/167880 co-relation queries the response was YES. Maximal size of possible extension queue 3501. Compared 438658 event pairs, 19171 based on Foata normal form. 0/54750 useless extension candidates. Maximal degree in co-relation 92910. Up to 36728 conditions per place. [2024-11-16 19:08:39,170 INFO L140 encePairwiseOnDemand]: 25/31 looper letters, 92 selfloop transitions, 34 changer transitions 0/128 dead transitions. [2024-11-16 19:08:39,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 128 transitions, 1417 flow [2024-11-16 19:08:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:08:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:08:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2024-11-16 19:08:39,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5591397849462365 [2024-11-16 19:08:39,171 INFO L175 Difference]: Start difference. First operand has 60 places, 74 transitions, 673 flow. Second operand 3 states and 52 transitions. [2024-11-16 19:08:39,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 128 transitions, 1417 flow [2024-11-16 19:08:39,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 128 transitions, 1352 flow, removed 17 selfloop flow, removed 1 redundant places. [2024-11-16 19:08:39,770 INFO L231 Difference]: Finished difference. Result has 63 places, 96 transitions, 1060 flow [2024-11-16 19:08:39,770 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=63, PETRI_TRANSITIONS=96} [2024-11-16 19:08:39,770 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 24 predicate places. [2024-11-16 19:08:39,771 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 96 transitions, 1060 flow [2024-11-16 19:08:39,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:39,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:39,771 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 19:08:39,771 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2130918489, now seen corresponding path program 1 times [2024-11-16 19:08:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181706199] [2024-11-16 19:08:39,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:39,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:08:39,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181706199] [2024-11-16 19:08:39,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181706199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:39,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:39,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:08:39,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257408173] [2024-11-16 19:08:39,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:39,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:08:39,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:39,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:08:39,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:08:39,829 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:39,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 96 transitions, 1060 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:39,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:39,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:39,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:08:47,151 INFO L124 PetriNetUnfolderBase]: 72299/102791 cut-off events. [2024-11-16 19:08:47,151 INFO L125 PetriNetUnfolderBase]: For 336523/336523 co-relation queries the response was YES. [2024-11-16 19:08:47,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 361989 conditions, 102791 events. 72299/102791 cut-off events. For 336523/336523 co-relation queries the response was YES. Maximal size of possible extension queue 6458. Compared 823631 event pairs, 11713 based on Foata normal form. 1292/98993 useless extension candidates. Maximal degree in co-relation 361881. Up to 32664 conditions per place. [2024-11-16 19:08:48,048 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 146 selfloop transitions, 87 changer transitions 0/235 dead transitions. [2024-11-16 19:08:48,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 235 transitions, 2793 flow [2024-11-16 19:08:48,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 19:08:48,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 19:08:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2024-11-16 19:08:48,051 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6290322580645161 [2024-11-16 19:08:48,051 INFO L175 Difference]: Start difference. First operand has 63 places, 96 transitions, 1060 flow. Second operand 6 states and 117 transitions. [2024-11-16 19:08:48,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 235 transitions, 2793 flow [2024-11-16 19:08:52,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 235 transitions, 2649 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:08:52,311 INFO L231 Difference]: Finished difference. Result has 70 places, 157 transitions, 2150 flow [2024-11-16 19:08:52,311 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2150, PETRI_PLACES=70, PETRI_TRANSITIONS=157} [2024-11-16 19:08:52,312 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 31 predicate places. [2024-11-16 19:08:52,312 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 157 transitions, 2150 flow [2024-11-16 19:08:52,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:52,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:08:52,312 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:08:52,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 19:08:52,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:08:52,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:08:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1906614775, now seen corresponding path program 2 times [2024-11-16 19:08:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:08:52,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287303186] [2024-11-16 19:08:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:08:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:08:52,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:08:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 19:08:52,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:08:52,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287303186] [2024-11-16 19:08:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287303186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:08:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:08:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:08:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827626333] [2024-11-16 19:08:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:08:52,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:08:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:08:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:08:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:08:52,373 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:08:52,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 157 transitions, 2150 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:08:52,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:08:52,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:08:52,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:09:01,337 INFO L124 PetriNetUnfolderBase]: 78247/112163 cut-off events. [2024-11-16 19:09:01,337 INFO L125 PetriNetUnfolderBase]: For 483359/483359 co-relation queries the response was YES. [2024-11-16 19:09:01,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425810 conditions, 112163 events. 78247/112163 cut-off events. For 483359/483359 co-relation queries the response was YES. Maximal size of possible extension queue 7227. Compared 921989 event pairs, 10871 based on Foata normal form. 1292/107659 useless extension candidates. Maximal degree in co-relation 295543. Up to 38966 conditions per place. [2024-11-16 19:09:02,367 INFO L140 encePairwiseOnDemand]: 21/31 looper letters, 175 selfloop transitions, 140 changer transitions 0/317 dead transitions. [2024-11-16 19:09:02,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 317 transitions, 4377 flow [2024-11-16 19:09:02,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 19:09:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-16 19:09:02,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2024-11-16 19:09:02,368 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5944700460829493 [2024-11-16 19:09:02,368 INFO L175 Difference]: Start difference. First operand has 70 places, 157 transitions, 2150 flow. Second operand 7 states and 129 transitions. [2024-11-16 19:09:02,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 317 transitions, 4377 flow [2024-11-16 19:09:08,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 317 transitions, 4377 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:09:08,788 INFO L231 Difference]: Finished difference. Result has 80 places, 221 transitions, 3716 flow [2024-11-16 19:09:08,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=31, PETRI_DIFFERENCE_MINUEND_FLOW=2150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3716, PETRI_PLACES=80, PETRI_TRANSITIONS=221} [2024-11-16 19:09:08,789 INFO L277 CegarLoopForPetriNet]: 39 programPoint places, 41 predicate places. [2024-11-16 19:09:08,789 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 221 transitions, 3716 flow [2024-11-16 19:09:08,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:08,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:09:08,789 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:09:08,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 19:09:08,789 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2024-11-16 19:09:08,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:09:08,790 INFO L85 PathProgramCache]: Analyzing trace with hash -2120494930, now seen corresponding path program 1 times [2024-11-16 19:09:08,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:09:08,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394551779] [2024-11-16 19:09:08,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:09:08,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:09:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:09:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-16 19:09:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:09:08,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394551779] [2024-11-16 19:09:08,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394551779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:09:08,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:09:08,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:09:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619851468] [2024-11-16 19:09:08,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:09:08,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 19:09:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:09:08,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 19:09:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 19:09:08,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 31 [2024-11-16 19:09:08,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 221 transitions, 3716 flow. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:09:08,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:09:08,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 31 [2024-11-16 19:09:08,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand