./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-theta/exponential-64.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-theta/exponential-64.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 c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:53:19,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:53:19,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:53:19,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:53:19,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:53:19,395 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:53:19,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:53:19,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:53:19,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:53:19,396 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:53:19,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:53:19,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:53:19,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:53:19,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:53:19,398 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:53:19,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:53:19,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:53:19,399 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:53:19,399 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:53:19,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:53:19,399 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:53:19,400 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:53:19,400 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:53:19,400 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:53:19,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:53:19,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:53:19,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:53:19,401 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:53:19,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:53:19,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:53:19,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:53:19,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:53:19,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:53:19,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:53:19,403 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:53:19,403 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:53:19,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:53:19,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:53:19,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:53:19,404 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:53:19,404 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:53:19,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:53:19,405 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 -> c5877a70884380b10e463fa3cfc6b55a5014f8a8b2ecd81a270409b479a9f5bc [2024-11-09 02:53:19,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:53:19,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:53:19,656 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:53:19,657 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:53:19,658 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:53:19,659 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-theta/exponential-64.i [2024-11-09 02:53:21,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:53:21,288 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:53:21,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-theta/exponential-64.i [2024-11-09 02:53:21,305 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca450cec/316e47c9dc8649078ca78b14a18bbeb4/FLAG233215363 [2024-11-09 02:53:21,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ca450cec/316e47c9dc8649078ca78b14a18bbeb4 [2024-11-09 02:53:21,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:53:21,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:53:21,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:53:21,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:53:21,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:53:21,328 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6432f776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21, skipping insertion in model container [2024-11-09 02:53:21,330 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:53:21,690 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-theta/exponential-64.i[33030,33043] [2024-11-09 02:53:21,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:53:21,716 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:53:21,757 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-theta/exponential-64.i[33030,33043] [2024-11-09 02:53:21,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:53:21,787 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:53:21,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21 WrapperNode [2024-11-09 02:53:21,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:53:21,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:53:21,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:53:21,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:53:21,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,837 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-09 02:53:21,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:53:21,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:53:21,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:53:21,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:53:21,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,874 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-09 02:53:21,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,885 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,890 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:53:21,890 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:53:21,890 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:53:21,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:53:21,893 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (1/1) ... [2024-11-09 02:53:21,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:53:21,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:21,924 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-09 02:53:21,931 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-09 02:53:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:53:21,969 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2024-11-09 02:53:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2024-11-09 02:53:21,970 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2024-11-09 02:53:21,970 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2024-11-09 02:53:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 02:53:21,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:53:21,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:53:21,972 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 02:53:22,094 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:53:22,097 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:53:22,257 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 02:53:22,258 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:53:22,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:53:22,345 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 02:53:22,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:22 BoogieIcfgContainer [2024-11-09 02:53:22,348 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:53:22,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:53:22,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:53:22,354 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:53:22,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:53:21" (1/3) ... [2024-11-09 02:53:22,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1a011e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:53:22, skipping insertion in model container [2024-11-09 02:53:22,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:53:21" (2/3) ... [2024-11-09 02:53:22,360 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1a011e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:53:22, skipping insertion in model container [2024-11-09 02:53:22,360 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:53:22" (3/3) ... [2024-11-09 02:53:22,362 INFO L112 eAbstractionObserver]: Analyzing ICFG exponential-64.i [2024-11-09 02:53:22,393 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:53:22,394 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:53:22,394 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 02:53:22,447 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:53:22,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 26 places, 22 transitions, 52 flow [2024-11-09 02:53:22,505 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2024-11-09 02:53:22,508 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:22,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37 conditions, 30 events. 4/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 49 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 20. Up to 4 conditions per place. [2024-11-09 02:53:22,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 26 places, 22 transitions, 52 flow [2024-11-09 02:53:22,514 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 23 places, 18 transitions, 43 flow [2024-11-09 02:53:22,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:22,526 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;@5e221e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:22,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:53:22,530 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:22,530 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-09 02:53:22,531 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:22,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:22,531 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 02:53:22,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:22,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:22,536 INFO L85 PathProgramCache]: Analyzing trace with hash 198549943, now seen corresponding path program 1 times [2024-11-09 02:53:22,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:22,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171831617] [2024-11-09 02:53:22,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:22,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:22,820 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-09 02:53:22,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:22,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171831617] [2024-11-09 02:53:22,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171831617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:22,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:22,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:53:22,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836061464] [2024-11-09 02:53:22,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:22,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:53:22,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:22,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:53:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:53:22,858 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 22 [2024-11-09 02:53:22,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 43 flow. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-09 02:53:22,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:22,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 22 [2024-11-09 02:53:22,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:22,911 INFO L124 PetriNetUnfolderBase]: 23/67 cut-off events. [2024-11-09 02:53:22,911 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:22,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 67 events. 23/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 227 event pairs, 9 based on Foata normal form. 0/53 useless extension candidates. Maximal degree in co-relation 110. Up to 37 conditions per place. [2024-11-09 02:53:22,916 INFO L140 encePairwiseOnDemand]: 19/22 looper letters, 12 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2024-11-09 02:53:22,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 77 flow [2024-11-09 02:53:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:53:22,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:53:22,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2024-11-09 02:53:22,926 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6363636363636364 [2024-11-09 02:53:22,927 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 43 flow. Second operand 3 states and 42 transitions. [2024-11-09 02:53:22,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 77 flow [2024-11-09 02:53:22,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 21 transitions, 76 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:22,931 INFO L231 Difference]: Finished difference. Result has 25 places, 18 transitions, 50 flow [2024-11-09 02:53:22,933 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=22, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=18} [2024-11-09 02:53:22,936 INFO L277 CegarLoopForPetriNet]: 23 programPoint places, 2 predicate places. [2024-11-09 02:53:22,936 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 18 transitions, 50 flow [2024-11-09 02:53:22,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-09 02:53:22,937 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:22,937 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:22,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:53:22,938 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:22,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:22,938 INFO L85 PathProgramCache]: Analyzing trace with hash 648166806, now seen corresponding path program 1 times [2024-11-09 02:53:22,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:22,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802462729] [2024-11-09 02:53:22,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:22,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:22,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:53:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:22,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:53:22,977 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:53:22,978 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-09 02:53:22,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 02:53:22,980 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:53:22,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:53:22,981 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 02:53:22,983 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:53:22,983 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-09 02:53:23,010 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:53:23,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 30 transitions, 80 flow [2024-11-09 02:53:23,027 INFO L124 PetriNetUnfolderBase]: 6/49 cut-off events. [2024-11-09 02:53:23,028 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 02:53:23,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 49 events. 6/49 cut-off events. For 3/3 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 43. Up to 6 conditions per place. [2024-11-09 02:53:23,029 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 30 transitions, 80 flow [2024-11-09 02:53:23,030 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 26 transitions, 70 flow [2024-11-09 02:53:23,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:23,032 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;@5e221e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:23,032 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:53:23,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:23,037 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-09 02:53:23,037 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:23,037 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:23,038 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 02:53:23,038 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:23,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:23,042 INFO L85 PathProgramCache]: Analyzing trace with hash 227179093, now seen corresponding path program 1 times [2024-11-09 02:53:23,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:23,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274968173] [2024-11-09 02:53:23,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:23,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:23,110 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-09 02:53:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:23,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274968173] [2024-11-09 02:53:23,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274968173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:23,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:23,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:53:23,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783515617] [2024-11-09 02:53:23,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:23,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:53:23,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:23,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:53:23,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:53:23,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:53:23,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-09 02:53:23,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:23,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:53:23,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:23,194 INFO L124 PetriNetUnfolderBase]: 211/419 cut-off events. [2024-11-09 02:53:23,195 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 02:53:23,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 419 events. 211/419 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2149 event pairs, 133 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 332. Up to 321 conditions per place. [2024-11-09 02:53:23,199 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 18 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2024-11-09 02:53:23,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 31 transitions, 120 flow [2024-11-09 02:53:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:53:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:53:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-09 02:53:23,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:53:23,201 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 70 flow. Second operand 3 states and 60 transitions. [2024-11-09 02:53:23,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 31 transitions, 120 flow [2024-11-09 02:53:23,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 119 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:23,205 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 81 flow [2024-11-09 02:53:23,205 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2024-11-09 02:53:23,206 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2024-11-09 02:53:23,206 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 81 flow [2024-11-09 02:53:23,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 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-09 02:53:23,207 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:23,207 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:23,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:53:23,208 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:23,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:23,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2102617054, now seen corresponding path program 1 times [2024-11-09 02:53:23,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:23,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7185920] [2024-11-09 02:53:23,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:23,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:23,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:23,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:23,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7185920] [2024-11-09 02:53:23,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7185920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:23,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:23,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:53:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259088836] [2024-11-09 02:53:23,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:23,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:53:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:53:23,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:53:23,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:53:23,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-09 02:53:23,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:23,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:53:23,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:23,414 INFO L124 PetriNetUnfolderBase]: 247/475 cut-off events. [2024-11-09 02:53:23,415 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-11-09 02:53:23,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 475 events. 247/475 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2583 event pairs, 191 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 400. Up to 333 conditions per place. [2024-11-09 02:53:23,421 INFO L140 encePairwiseOnDemand]: 26/30 looper letters, 18 selfloop transitions, 3 changer transitions 0/32 dead transitions. [2024-11-09 02:53:23,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 133 flow [2024-11-09 02:53:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:53:23,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:53:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2024-11-09 02:53:23,424 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6083333333333333 [2024-11-09 02:53:23,424 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 81 flow. Second operand 4 states and 73 transitions. [2024-11-09 02:53:23,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 133 flow [2024-11-09 02:53:23,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:23,426 INFO L231 Difference]: Finished difference. Result has 40 places, 28 transitions, 93 flow [2024-11-09 02:53:23,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=40, PETRI_TRANSITIONS=28} [2024-11-09 02:53:23,429 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 5 predicate places. [2024-11-09 02:53:23,430 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 28 transitions, 93 flow [2024-11-09 02:53:23,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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-09 02:53:23,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:23,430 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:23,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:53:23,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:23,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:23,432 INFO L85 PathProgramCache]: Analyzing trace with hash 756593096, now seen corresponding path program 1 times [2024-11-09 02:53:23,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:23,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554877147] [2024-11-09 02:53:23,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:23,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:23,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:23,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:23,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554877147] [2024-11-09 02:53:23,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554877147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:23,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880040321] [2024-11-09 02:53:23,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:23,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:23,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:23,546 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:23,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 02:53:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:23,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:53:23,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:23,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:23,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880040321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:23,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 02:53:23,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245973823] [2024-11-09 02:53:23,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:23,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:53:23,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:23,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:53:23,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:53:23,771 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 30 [2024-11-09 02:53:23,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 93 flow. Second operand has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-09 02:53:23,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:23,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 30 [2024-11-09 02:53:23,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:23,850 INFO L124 PetriNetUnfolderBase]: 119/247 cut-off events. [2024-11-09 02:53:23,850 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-09 02:53:23,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 520 conditions, 247 events. 119/247 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1148 event pairs, 33 based on Foata normal form. 20/261 useless extension candidates. Maximal degree in co-relation 512. Up to 96 conditions per place. [2024-11-09 02:53:23,852 INFO L140 encePairwiseOnDemand]: 27/30 looper letters, 19 selfloop transitions, 3 changer transitions 0/31 dead transitions. [2024-11-09 02:53:23,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 131 flow [2024-11-09 02:53:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:53:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 02:53:23,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2024-11-09 02:53:23,854 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5933333333333334 [2024-11-09 02:53:23,854 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 93 flow. Second operand 5 states and 89 transitions. [2024-11-09 02:53:23,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 131 flow [2024-11-09 02:53:23,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:23,856 INFO L231 Difference]: Finished difference. Result has 38 places, 22 transitions, 74 flow [2024-11-09 02:53:23,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=30, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=22} [2024-11-09 02:53:23,857 INFO L277 CegarLoopForPetriNet]: 35 programPoint places, 3 predicate places. [2024-11-09 02:53:23,857 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 22 transitions, 74 flow [2024-11-09 02:53:23,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.875) internal successors, (127), 8 states have internal predecessors, (127), 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-09 02:53:23,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:23,858 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:23,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 02:53:24,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:24,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:24,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:24,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1307663877, now seen corresponding path program 1 times [2024-11-09 02:53:24,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:24,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950933647] [2024-11-09 02:53:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:24,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:24,091 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:53:24,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:24,110 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:53:24,112 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:53:24,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-09 02:53:24,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 02:53:24,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:53:24,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:53:24,116 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 02:53:24,117 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:53:24,117 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-09 02:53:24,141 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:53:24,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 38 transitions, 112 flow [2024-11-09 02:53:24,150 INFO L124 PetriNetUnfolderBase]: 8/68 cut-off events. [2024-11-09 02:53:24,150 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-09 02:53:24,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 68 events. 8/68 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 0/52 useless extension candidates. Maximal degree in co-relation 70. Up to 8 conditions per place. [2024-11-09 02:53:24,151 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 38 transitions, 112 flow [2024-11-09 02:53:24,151 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 34 transitions, 101 flow [2024-11-09 02:53:24,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:24,154 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;@5e221e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:24,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:53:24,156 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:24,157 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-09 02:53:24,157 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:24,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:24,157 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 02:53:24,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:24,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:24,158 INFO L85 PathProgramCache]: Analyzing trace with hash 263442683, now seen corresponding path program 1 times [2024-11-09 02:53:24,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:24,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407525906] [2024-11-09 02:53:24,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:24,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:24,197 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-09 02:53:24,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:24,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407525906] [2024-11-09 02:53:24,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407525906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:24,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:24,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:53:24,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320573094] [2024-11-09 02:53:24,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:24,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:53:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:53:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:53:24,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-09 02:53:24,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 101 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-09 02:53:24,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:24,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-09 02:53:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:24,424 INFO L124 PetriNetUnfolderBase]: 1347/2211 cut-off events. [2024-11-09 02:53:24,424 INFO L125 PetriNetUnfolderBase]: For 348/348 co-relation queries the response was YES. [2024-11-09 02:53:24,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4306 conditions, 2211 events. 1347/2211 cut-off events. For 348/348 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13076 event pairs, 1013 based on Foata normal form. 0/1878 useless extension candidates. Maximal degree in co-relation 1892. Up to 1841 conditions per place. [2024-11-09 02:53:24,436 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 22 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2024-11-09 02:53:24,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 159 flow [2024-11-09 02:53:24,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:53:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:53:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2024-11-09 02:53:24,438 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:53:24,438 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 101 flow. Second operand 3 states and 76 transitions. [2024-11-09 02:53:24,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 159 flow [2024-11-09 02:53:24,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 39 transitions, 154 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:24,444 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 108 flow [2024-11-09 02:53:24,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2024-11-09 02:53:24,445 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2024-11-09 02:53:24,445 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 108 flow [2024-11-09 02:53:24,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 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-09 02:53:24,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:24,446 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:24,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:53:24,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash 744679793, now seen corresponding path program 1 times [2024-11-09 02:53:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535275056] [2024-11-09 02:53:24,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:24,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:24,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535275056] [2024-11-09 02:53:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535275056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:53:24,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706325071] [2024-11-09 02:53:24,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:24,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:53:24,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:24,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:53:24,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:53:24,503 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-09 02:53:24,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:24,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:24,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-09 02:53:24,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:24,675 INFO L124 PetriNetUnfolderBase]: 1575/2523 cut-off events. [2024-11-09 02:53:24,676 INFO L125 PetriNetUnfolderBase]: For 262/262 co-relation queries the response was YES. [2024-11-09 02:53:24,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5056 conditions, 2523 events. 1575/2523 cut-off events. For 262/262 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 15218 event pairs, 1135 based on Foata normal form. 0/2314 useless extension candidates. Maximal degree in co-relation 2224. Up to 1853 conditions per place. [2024-11-09 02:53:24,691 INFO L140 encePairwiseOnDemand]: 34/38 looper letters, 24 selfloop transitions, 3 changer transitions 0/42 dead transitions. [2024-11-09 02:53:24,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 176 flow [2024-11-09 02:53:24,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:53:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:53:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2024-11-09 02:53:24,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.625 [2024-11-09 02:53:24,694 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 108 flow. Second operand 4 states and 95 transitions. [2024-11-09 02:53:24,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 176 flow [2024-11-09 02:53:24,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 174 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:24,697 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 120 flow [2024-11-09 02:53:24,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2024-11-09 02:53:24,697 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 5 predicate places. [2024-11-09 02:53:24,697 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 120 flow [2024-11-09 02:53:24,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:24,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:24,698 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:24,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:53:24,698 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:24,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:24,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1610211003, now seen corresponding path program 1 times [2024-11-09 02:53:24,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:24,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561126991] [2024-11-09 02:53:24,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:24,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:24,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561126991] [2024-11-09 02:53:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561126991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259740526] [2024-11-09 02:53:24,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:24,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:24,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:24,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:24,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 02:53:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:24,825 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:53:24,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:24,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:24,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259740526] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:24,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:24,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 02:53:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291654908] [2024-11-09 02:53:24,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:53:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:24,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:53:24,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:53:24,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 38 [2024-11-09 02:53:24,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 120 flow. Second operand has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 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-09 02:53:24,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:24,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 38 [2024-11-09 02:53:24,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:25,022 INFO L124 PetriNetUnfolderBase]: 807/1335 cut-off events. [2024-11-09 02:53:25,022 INFO L125 PetriNetUnfolderBase]: For 516/516 co-relation queries the response was YES. [2024-11-09 02:53:25,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1335 events. 807/1335 cut-off events. For 516/516 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7267 event pairs, 113 based on Foata normal form. 84/1362 useless extension candidates. Maximal degree in co-relation 2752. Up to 528 conditions per place. [2024-11-09 02:53:25,030 INFO L140 encePairwiseOnDemand]: 35/38 looper letters, 31 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2024-11-09 02:53:25,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 204 flow [2024-11-09 02:53:25,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:53:25,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:53:25,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2024-11-09 02:53:25,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6140350877192983 [2024-11-09 02:53:25,032 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 120 flow. Second operand 6 states and 140 transitions. [2024-11-09 02:53:25,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 204 flow [2024-11-09 02:53:25,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 48 transitions, 203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:25,034 INFO L231 Difference]: Finished difference. Result has 51 places, 31 transitions, 107 flow [2024-11-09 02:53:25,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=38, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=107, PETRI_PLACES=51, PETRI_TRANSITIONS=31} [2024-11-09 02:53:25,034 INFO L277 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2024-11-09 02:53:25,034 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 31 transitions, 107 flow [2024-11-09 02:53:25,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.875) internal successors, (159), 8 states have internal predecessors, (159), 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-09 02:53:25,035 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:25,035 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:25,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 02:53:25,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-09 02:53:25,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:25,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:25,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1135638216, now seen corresponding path program 1 times [2024-11-09 02:53:25,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:25,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027050412] [2024-11-09 02:53:25,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:25,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:25,252 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:53:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:25,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:53:25,266 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:53:25,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-09 02:53:25,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 02:53:25,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:53:25,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:53:25,267 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 02:53:25,267 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:53:25,267 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-11-09 02:53:25,292 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:53:25,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 46 transitions, 148 flow [2024-11-09 02:53:25,298 INFO L124 PetriNetUnfolderBase]: 10/87 cut-off events. [2024-11-09 02:53:25,299 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-09 02:53:25,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 87 events. 10/87 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/67 useless extension candidates. Maximal degree in co-relation 99. Up to 10 conditions per place. [2024-11-09 02:53:25,299 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 46 transitions, 148 flow [2024-11-09 02:53:25,300 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 42 transitions, 136 flow [2024-11-09 02:53:25,300 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:25,301 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;@5e221e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:25,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:53:25,303 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:25,303 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-09 02:53:25,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:25,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:25,303 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 02:53:25,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:25,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:25,304 INFO L85 PathProgramCache]: Analyzing trace with hash 307340713, now seen corresponding path program 1 times [2024-11-09 02:53:25,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:25,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738048922] [2024-11-09 02:53:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:25,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:25,341 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-09 02:53:25,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:25,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738048922] [2024-11-09 02:53:25,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738048922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:25,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:25,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:53:25,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684021868] [2024-11-09 02:53:25,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:25,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:53:25,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:25,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:53:25,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:53:25,344 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-09 02:53:25,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 02:53:25,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:25,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-09 02:53:25,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:26,175 INFO L124 PetriNetUnfolderBase]: 7427/10915 cut-off events. [2024-11-09 02:53:26,175 INFO L125 PetriNetUnfolderBase]: For 2844/2844 co-relation queries the response was YES. [2024-11-09 02:53:26,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21588 conditions, 10915 events. 7427/10915 cut-off events. For 2844/2844 co-relation queries the response was YES. Maximal size of possible extension queue 522. Compared 68764 event pairs, 6069 based on Foata normal form. 0/9566 useless extension candidates. Maximal degree in co-relation 9764. Up to 9457 conditions per place. [2024-11-09 02:53:26,243 INFO L140 encePairwiseOnDemand]: 43/46 looper letters, 26 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2024-11-09 02:53:26,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 47 transitions, 202 flow [2024-11-09 02:53:26,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:53:26,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:53:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2024-11-09 02:53:26,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:53:26,245 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 136 flow. Second operand 3 states and 92 transitions. [2024-11-09 02:53:26,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 47 transitions, 202 flow [2024-11-09 02:53:26,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 47 transitions, 189 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:26,255 INFO L231 Difference]: Finished difference. Result has 61 places, 43 transitions, 135 flow [2024-11-09 02:53:26,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=61, PETRI_TRANSITIONS=43} [2024-11-09 02:53:26,257 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2024-11-09 02:53:26,258 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 43 transitions, 135 flow [2024-11-09 02:53:26,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 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-09 02:53:26,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:26,258 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:26,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:53:26,258 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:26,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:26,259 INFO L85 PathProgramCache]: Analyzing trace with hash 339211268, now seen corresponding path program 1 times [2024-11-09 02:53:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:26,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960148449] [2024-11-09 02:53:26,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:26,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:26,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:26,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:26,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:26,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960148449] [2024-11-09 02:53:26,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960148449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:26,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:26,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:53:26,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695185129] [2024-11-09 02:53:26,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:26,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:53:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:26,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:53:26,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:53:26,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-09 02:53:26,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 43 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-09 02:53:26,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:26,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-09 02:53:26,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:27,275 INFO L124 PetriNetUnfolderBase]: 8679/12507 cut-off events. [2024-11-09 02:53:27,275 INFO L125 PetriNetUnfolderBase]: For 1830/1830 co-relation queries the response was YES. [2024-11-09 02:53:27,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25026 conditions, 12507 events. 8679/12507 cut-off events. For 1830/1830 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 78544 event pairs, 6351 based on Foata normal form. 0/11658 useless extension candidates. Maximal degree in co-relation 11312. Up to 9469 conditions per place. [2024-11-09 02:53:27,378 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 30 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2024-11-09 02:53:27,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 52 transitions, 219 flow [2024-11-09 02:53:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:53:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:53:27,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 117 transitions. [2024-11-09 02:53:27,382 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6358695652173914 [2024-11-09 02:53:27,382 INFO L175 Difference]: Start difference. First operand has 61 places, 43 transitions, 135 flow. Second operand 4 states and 117 transitions. [2024-11-09 02:53:27,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 52 transitions, 219 flow [2024-11-09 02:53:27,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 52 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:27,389 INFO L231 Difference]: Finished difference. Result has 64 places, 44 transitions, 147 flow [2024-11-09 02:53:27,389 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=64, PETRI_TRANSITIONS=44} [2024-11-09 02:53:27,390 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2024-11-09 02:53:27,390 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 44 transitions, 147 flow [2024-11-09 02:53:27,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 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-09 02:53:27,391 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:27,391 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:27,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:53:27,391 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1925588662, now seen corresponding path program 1 times [2024-11-09 02:53:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:27,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407522215] [2024-11-09 02:53:27,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:27,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:27,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:27,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:27,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407522215] [2024-11-09 02:53:27,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407522215] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:27,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483307754] [2024-11-09 02:53:27,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:27,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:27,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:27,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:27,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 02:53:27,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:27,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:53:27,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:27,687 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:27,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483307754] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:27,713 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:27,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 02:53:27,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390949905] [2024-11-09 02:53:27,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:27,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:53:27,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:53:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:53:27,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-09 02:53:27,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 44 transitions, 147 flow. Second operand has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 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-09 02:53:27,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:27,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-09 02:53:27,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:28,622 INFO L124 PetriNetUnfolderBase]: 7911/11319 cut-off events. [2024-11-09 02:53:28,622 INFO L125 PetriNetUnfolderBase]: For 2850/2850 co-relation queries the response was YES. [2024-11-09 02:53:28,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24012 conditions, 11319 events. 7911/11319 cut-off events. For 2850/2850 co-relation queries the response was YES. Maximal size of possible extension queue 555. Compared 67543 event pairs, 839 based on Foata normal form. 84/11022 useless extension candidates. Maximal degree in co-relation 13760. Up to 5377 conditions per place. [2024-11-09 02:53:28,689 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 48 selfloop transitions, 6 changer transitions 0/73 dead transitions. [2024-11-09 02:53:28,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 317 flow [2024-11-09 02:53:28,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:53:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:53:28,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 182 transitions. [2024-11-09 02:53:28,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6594202898550725 [2024-11-09 02:53:28,691 INFO L175 Difference]: Start difference. First operand has 64 places, 44 transitions, 147 flow. Second operand 6 states and 182 transitions. [2024-11-09 02:53:28,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 317 flow [2024-11-09 02:53:28,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 73 transitions, 311 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 02:53:28,710 INFO L231 Difference]: Finished difference. Result has 71 places, 47 transitions, 181 flow [2024-11-09 02:53:28,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=181, PETRI_PLACES=71, PETRI_TRANSITIONS=47} [2024-11-09 02:53:28,711 INFO L277 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2024-11-09 02:53:28,711 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 47 transitions, 181 flow [2024-11-09 02:53:28,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.875) internal successors, (191), 8 states have internal predecessors, (191), 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-09 02:53:28,711 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:28,711 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:28,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 02:53:28,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:28,913 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:28,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash -95023867, now seen corresponding path program 1 times [2024-11-09 02:53:28,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:28,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673790825] [2024-11-09 02:53:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:28,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:28,925 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:53:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:28,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:53:28,957 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:53:28,957 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-09 02:53:28,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 02:53:28,957 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:53:28,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:53:28,957 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-09 02:53:28,958 WARN L244 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:53:28,958 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2024-11-09 02:53:28,986 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:53:28,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 54 transitions, 188 flow [2024-11-09 02:53:28,995 INFO L124 PetriNetUnfolderBase]: 12/106 cut-off events. [2024-11-09 02:53:28,997 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2024-11-09 02:53:28,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 106 events. 12/106 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 231 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 130. Up to 12 conditions per place. [2024-11-09 02:53:28,998 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 54 transitions, 188 flow [2024-11-09 02:53:28,998 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 50 transitions, 175 flow [2024-11-09 02:53:29,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:29,000 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;@5e221e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:29,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:53:29,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:29,002 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-09 02:53:29,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:29,002 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:29,002 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 02:53:29,003 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 358873183, now seen corresponding path program 1 times [2024-11-09 02:53:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104961893] [2024-11-09 02:53:29,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:29,032 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-09 02:53:29,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:29,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104961893] [2024-11-09 02:53:29,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104961893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:29,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:29,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:53:29,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124036236] [2024-11-09 02:53:29,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:29,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:53:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:53:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:53:29,034 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-09 02:53:29,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 50 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:29,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:29,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-09 02:53:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:33,312 INFO L124 PetriNetUnfolderBase]: 37891/51875 cut-off events. [2024-11-09 02:53:33,313 INFO L125 PetriNetUnfolderBase]: For 19228/19228 co-relation queries the response was YES. [2024-11-09 02:53:33,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103766 conditions, 51875 events. 37891/51875 cut-off events. For 19228/19228 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 336813 event pairs, 32437 based on Foata normal form. 0/46430 useless extension candidates. Maximal degree in co-relation 47780. Up to 46065 conditions per place. [2024-11-09 02:53:34,035 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2024-11-09 02:53:34,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 55 transitions, 249 flow [2024-11-09 02:53:34,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:53:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 02:53:34,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2024-11-09 02:53:34,040 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2024-11-09 02:53:34,040 INFO L175 Difference]: Start difference. First operand has 71 places, 50 transitions, 175 flow. Second operand 3 states and 108 transitions. [2024-11-09 02:53:34,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 55 transitions, 249 flow [2024-11-09 02:53:34,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 55 transitions, 224 flow, removed 12 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:34,096 INFO L231 Difference]: Finished difference. Result has 73 places, 51 transitions, 162 flow [2024-11-09 02:53:34,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=73, PETRI_TRANSITIONS=51} [2024-11-09 02:53:34,097 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 2 predicate places. [2024-11-09 02:53:34,097 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 51 transitions, 162 flow [2024-11-09 02:53:34,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 02:53:34,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:34,097 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:34,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:53:34,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:34,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:34,098 INFO L85 PathProgramCache]: Analyzing trace with hash 886211479, now seen corresponding path program 1 times [2024-11-09 02:53:34,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:34,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882374538] [2024-11-09 02:53:34,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:34,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882374538] [2024-11-09 02:53:34,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882374538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:34,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:34,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:53:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669299604] [2024-11-09 02:53:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:53:34,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:34,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:53:34,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:53:34,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-09 02:53:34,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 51 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-09 02:53:34,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:34,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-09 02:53:34,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:38,744 INFO L124 PetriNetUnfolderBase]: 44263/59611 cut-off events. [2024-11-09 02:53:38,744 INFO L125 PetriNetUnfolderBase]: For 11430/11430 co-relation queries the response was YES. [2024-11-09 02:53:39,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119236 conditions, 59611 events. 44263/59611 cut-off events. For 11430/11430 co-relation queries the response was YES. Maximal size of possible extension queue 2328. Compared 382012 event pairs, 36527 based on Foata normal form. 0/56202 useless extension candidates. Maximal degree in co-relation 54832. Up to 46077 conditions per place. [2024-11-09 02:53:39,283 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 36 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-11-09 02:53:39,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 62 transitions, 262 flow [2024-11-09 02:53:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:53:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 02:53:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2024-11-09 02:53:39,284 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6435185185185185 [2024-11-09 02:53:39,285 INFO L175 Difference]: Start difference. First operand has 73 places, 51 transitions, 162 flow. Second operand 4 states and 139 transitions. [2024-11-09 02:53:39,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 62 transitions, 262 flow [2024-11-09 02:53:39,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 62 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 02:53:39,309 INFO L231 Difference]: Finished difference. Result has 76 places, 52 transitions, 174 flow [2024-11-09 02:53:39,309 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=76, PETRI_TRANSITIONS=52} [2024-11-09 02:53:39,309 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 5 predicate places. [2024-11-09 02:53:39,310 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 52 transitions, 174 flow [2024-11-09 02:53:39,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 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-09 02:53:39,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:39,310 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:39,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:53:39,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:39,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:39,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1702726073, now seen corresponding path program 1 times [2024-11-09 02:53:39,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:39,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687078366] [2024-11-09 02:53:39,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:39,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:39,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687078366] [2024-11-09 02:53:39,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687078366] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:39,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924160564] [2024-11-09 02:53:39,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:39,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:39,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:39,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:39,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 02:53:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:39,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 02:53:39,433 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:39,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:39,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:39,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924160564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:39,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:39,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2024-11-09 02:53:39,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547752749] [2024-11-09 02:53:39,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:39,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:53:39,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:39,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:53:39,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:53:39,487 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-09 02:53:39,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 52 transitions, 174 flow. Second operand has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 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-09 02:53:39,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:39,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-09 02:53:39,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:43,767 INFO L124 PetriNetUnfolderBase]: 43495/58423 cut-off events. [2024-11-09 02:53:43,768 INFO L125 PetriNetUnfolderBase]: For 12834/12834 co-relation queries the response was YES. [2024-11-09 02:53:44,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123342 conditions, 58423 events. 43495/58423 cut-off events. For 12834/12834 co-relation queries the response was YES. Maximal size of possible extension queue 2197. Compared 367329 event pairs, 5447 based on Foata normal form. 84/55350 useless extension candidates. Maximal degree in co-relation 65984. Up to 30977 conditions per place. [2024-11-09 02:53:44,568 INFO L140 encePairwiseOnDemand]: 50/54 looper letters, 54 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-11-09 02:53:44,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 83 transitions, 360 flow [2024-11-09 02:53:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:53:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 02:53:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions. [2024-11-09 02:53:44,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2024-11-09 02:53:44,571 INFO L175 Difference]: Start difference. First operand has 76 places, 52 transitions, 174 flow. Second operand 6 states and 212 transitions. [2024-11-09 02:53:44,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 83 transitions, 360 flow [2024-11-09 02:53:45,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 83 transitions, 354 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-09 02:53:45,092 INFO L231 Difference]: Finished difference. Result has 83 places, 55 transitions, 208 flow [2024-11-09 02:53:45,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=208, PETRI_PLACES=83, PETRI_TRANSITIONS=55} [2024-11-09 02:53:45,093 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 12 predicate places. [2024-11-09 02:53:45,093 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 55 transitions, 208 flow [2024-11-09 02:53:45,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 27.875) internal successors, (223), 8 states have internal predecessors, (223), 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-09 02:53:45,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:45,094 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:45,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 02:53:45,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-09 02:53:45,295 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:45,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1283341195, now seen corresponding path program 1 times [2024-11-09 02:53:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948602673] [2024-11-09 02:53:45,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:45,394 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:45,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948602673] [2024-11-09 02:53:45,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948602673] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:53:45,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630270132] [2024-11-09 02:53:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:45,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 02:53:45,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:53:45,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 02:53:45,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 02:53:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:45,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 02:53:45,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:53:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:45,572 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:53:45,644 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 02:53:45,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630270132] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:53:45,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 02:53:45,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2024-11-09 02:53:45,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547007134] [2024-11-09 02:53:45,645 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 02:53:45,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 02:53:45,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:45,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 02:53:45,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2024-11-09 02:53:45,647 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2024-11-09 02:53:45,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 55 transitions, 208 flow. Second operand has 17 states, 17 states have (on average 29.0) internal successors, (493), 17 states have internal predecessors, (493), 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-09 02:53:45,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:45,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2024-11-09 02:53:45,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 02:53:48,282 INFO L124 PetriNetUnfolderBase]: 23783/32311 cut-off events. [2024-11-09 02:53:48,282 INFO L125 PetriNetUnfolderBase]: For 28414/28414 co-relation queries the response was YES. [2024-11-09 02:53:48,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71371 conditions, 32311 events. 23783/32311 cut-off events. For 28414/28414 co-relation queries the response was YES. Maximal size of possible extension queue 1249. Compared 194386 event pairs, 1607 based on Foata normal form. 1280/33248 useless extension candidates. Maximal degree in co-relation 71354. Up to 13568 conditions per place. [2024-11-09 02:53:48,575 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 61 selfloop transitions, 6 changer transitions 0/88 dead transitions. [2024-11-09 02:53:48,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 410 flow [2024-11-09 02:53:48,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 02:53:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 02:53:48,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 269 transitions. [2024-11-09 02:53:48,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6226851851851852 [2024-11-09 02:53:48,577 INFO L175 Difference]: Start difference. First operand has 83 places, 55 transitions, 208 flow. Second operand 8 states and 269 transitions. [2024-11-09 02:53:48,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 410 flow [2024-11-09 02:53:48,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 389 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-11-09 02:53:48,662 INFO L231 Difference]: Finished difference. Result has 80 places, 50 transitions, 182 flow [2024-11-09 02:53:48,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=182, PETRI_PLACES=80, PETRI_TRANSITIONS=50} [2024-11-09 02:53:48,663 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2024-11-09 02:53:48,663 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 50 transitions, 182 flow [2024-11-09 02:53:48,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 29.0) internal successors, (493), 17 states have internal predecessors, (493), 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-09 02:53:48,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:48,665 INFO L204 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:53:48,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 02:53:48,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 02:53:48,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:48,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:48,866 INFO L85 PathProgramCache]: Analyzing trace with hash 123626874, now seen corresponding path program 1 times [2024-11-09 02:53:48,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:48,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956849434] [2024-11-09 02:53:48,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:48,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:48,886 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:53:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:53:48,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:53:48,906 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:53:48,906 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-11-09 02:53:48,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-11-09 02:53:48,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-11-09 02:53:48,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:53:48,907 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-09 02:53:48,907 WARN L244 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-09 02:53:48,907 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2024-11-09 02:53:48,927 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 02:53:48,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 86 places, 62 transitions, 232 flow [2024-11-09 02:53:48,934 INFO L124 PetriNetUnfolderBase]: 14/125 cut-off events. [2024-11-09 02:53:48,934 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-11-09 02:53:48,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 125 events. 14/125 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 272 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 163. Up to 14 conditions per place. [2024-11-09 02:53:48,935 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 62 transitions, 232 flow [2024-11-09 02:53:48,936 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 58 transitions, 218 flow [2024-11-09 02:53:48,936 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:53:48,937 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;@5e221e42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:53:48,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 02:53:48,938 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 02:53:48,938 INFO L124 PetriNetUnfolderBase]: 1/11 cut-off events. [2024-11-09 02:53:48,938 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 02:53:48,938 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 02:53:48,938 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 02:53:48,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-11-09 02:53:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:53:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 418040093, now seen corresponding path program 1 times [2024-11-09 02:53:48,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:53:48,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674209048] [2024-11-09 02:53:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:53:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:53:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:53:48,955 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-09 02:53:48,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:53:48,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674209048] [2024-11-09 02:53:48,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674209048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:53:48,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:53:48,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:53:48,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920065038] [2024-11-09 02:53:48,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:53:48,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:53:48,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:53:48,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:53:48,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:53:48,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 62 [2024-11-09 02:53:48,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 58 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 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-09 02:53:48,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 02:53:48,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 62 [2024-11-09 02:53:48,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand