/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:24:41,748 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:24:41,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-10 12:24:41,837 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:24:41,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:24:41,839 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:24:41,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:24:41,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:24:41,840 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:24:41,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:24:41,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:24:41,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:24:41,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:24:41,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:24:41,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:24:41,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:24:41,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:24:41,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:24:41,845 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:24:41,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:24:41,845 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:24:41,846 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:24:41,846 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:24:41,846 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:24:41,846 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:24:41,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:24:41,847 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:24:41,847 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:24:41,847 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:24:41,847 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:24:41,848 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:24:41,848 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:24:41,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:24:41,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2023-11-10 12:24:42,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:24:42,058 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:24:42,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:24:42,060 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:24:42,061 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:24:42,061 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-11-10 12:24:43,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:24:43,195 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:24:43,195 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2023-11-10 12:24:43,201 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad082da6/1d015d2dd8734f60a13d97a9f6d41b22/FLAGeb3e67aa3 [2023-11-10 12:24:43,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aad082da6/1d015d2dd8734f60a13d97a9f6d41b22 [2023-11-10 12:24:43,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:24:43,213 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:24:43,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:24:43,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:24:43,219 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:24:43,220 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f350bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43, skipping insertion in model container [2023-11-10 12:24:43,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,239 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:24:43,374 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-11-10 12:24:43,382 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:24:43,390 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:24:43,404 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2428,2441] [2023-11-10 12:24:43,408 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:24:43,412 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:24:43,413 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 12:24:43,417 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:24:43,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43 WrapperNode [2023-11-10 12:24:43,417 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:24:43,418 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:24:43,419 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:24:43,419 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:24:43,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,452 INFO L138 Inliner]: procedures = 26, calls = 40, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 148 [2023-11-10 12:24:43,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:24:43,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:24:43,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:24:43,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:24:43,463 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,463 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,466 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,473 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,474 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,476 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:24:43,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:24:43,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:24:43,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:24:43,479 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (1/1) ... [2023-11-10 12:24:43,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:24:43,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:24:43,503 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-10 12:24:43,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-10 12:24:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:24:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:24:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:24:43,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:24:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:24:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:24:43,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:24:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:24:43,527 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:24:43,623 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:24:43,625 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:24:43,814 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:24:43,897 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:24:43,897 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-10 12:24:43,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:24:43 BoogieIcfgContainer [2023-11-10 12:24:43,900 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:24:43,901 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:24:43,901 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:24:43,920 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:24:43,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:24:43" (1/3) ... [2023-11-10 12:24:43,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ef3363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:24:43, skipping insertion in model container [2023-11-10 12:24:43,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:24:43" (2/3) ... [2023-11-10 12:24:43,921 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35ef3363 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:24:43, skipping insertion in model container [2023-11-10 12:24:43,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:24:43" (3/3) ... [2023-11-10 12:24:43,922 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2023-11-10 12:24:43,933 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:24:43,933 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:24:43,933 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:24:43,969 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-10 12:24:44,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 120 transitions, 254 flow [2023-11-10 12:24:44,064 INFO L124 PetriNetUnfolderBase]: 9/118 cut-off events. [2023-11-10 12:24:44,064 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:24:44,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 118 events. 9/118 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-11-10 12:24:44,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 120 transitions, 254 flow [2023-11-10 12:24:44,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 109 transitions, 230 flow [2023-11-10 12:24:44,081 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:24:44,088 INFO L357 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, mHoare=false, 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;@5da114c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:24:44,088 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-10 12:24:44,103 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:24:44,104 INFO L124 PetriNetUnfolderBase]: 9/108 cut-off events. [2023-11-10 12:24:44,104 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-10 12:24:44,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:44,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:44,105 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:44,108 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:44,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1482521445, now seen corresponding path program 1 times [2023-11-10 12:24:44,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:44,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158298293] [2023-11-10 12:24:44,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:44,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:24:44,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:44,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158298293] [2023-11-10 12:24:44,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158298293] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:24:44,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:24:44,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-10 12:24:44,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897007199] [2023-11-10 12:24:44,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:24:44,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-10 12:24:44,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-10 12:24:44,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-10 12:24:44,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 120 [2023-11-10 12:24:44,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 109 transitions, 230 flow. Second operand has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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) [2023-11-10 12:24:44,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:44,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 120 [2023-11-10 12:24:44,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:44,673 INFO L124 PetriNetUnfolderBase]: 26/202 cut-off events. [2023-11-10 12:24:44,673 INFO L125 PetriNetUnfolderBase]: For 36/37 co-relation queries the response was YES. [2023-11-10 12:24:44,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 202 events. 26/202 cut-off events. For 36/37 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 567 event pairs, 3 based on Foata normal form. 23/209 useless extension candidates. Maximal degree in co-relation 148. Up to 43 conditions per place. [2023-11-10 12:24:44,678 INFO L140 encePairwiseOnDemand]: 105/120 looper letters, 30 selfloop transitions, 3 changer transitions 8/114 dead transitions. [2023-11-10 12:24:44,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 114 transitions, 331 flow [2023-11-10 12:24:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:24:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:24:44,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 632 transitions. [2023-11-10 12:24:44,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7523809523809524 [2023-11-10 12:24:44,695 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 632 transitions. [2023-11-10 12:24:44,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 632 transitions. [2023-11-10 12:24:44,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:44,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 632 transitions. [2023-11-10 12:24:44,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 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) [2023-11-10 12:24:44,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-10 12:24:44,707 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-10 12:24:44,708 INFO L175 Difference]: Start difference. First operand has 107 places, 109 transitions, 230 flow. Second operand 7 states and 632 transitions. [2023-11-10 12:24:44,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 114 transitions, 331 flow [2023-11-10 12:24:44,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 114 transitions, 317 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 12:24:44,714 INFO L231 Difference]: Finished difference. Result has 112 places, 102 transitions, 227 flow [2023-11-10 12:24:44,715 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=227, PETRI_PLACES=112, PETRI_TRANSITIONS=102} [2023-11-10 12:24:44,717 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 5 predicate places. [2023-11-10 12:24:44,718 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 102 transitions, 227 flow [2023-11-10 12:24:44,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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) [2023-11-10 12:24:44,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:44,718 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:44,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:24:44,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:44,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:44,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1382382049, now seen corresponding path program 1 times [2023-11-10 12:24:44,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:44,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051036492] [2023-11-10 12:24:44,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:44,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:24:44,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:44,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051036492] [2023-11-10 12:24:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051036492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:24:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:24:44,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:24:44,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896742155] [2023-11-10 12:24:44,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:24:44,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:24:44,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:24:44,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:24:44,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 120 [2023-11-10 12:24:44,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 102 transitions, 227 flow. Second operand has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 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) [2023-11-10 12:24:44,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:44,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 120 [2023-11-10 12:24:44,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:45,081 INFO L124 PetriNetUnfolderBase]: 115/450 cut-off events. [2023-11-10 12:24:45,081 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-10 12:24:45,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 450 events. 115/450 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2050 event pairs, 63 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 749. Up to 149 conditions per place. [2023-11-10 12:24:45,086 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 39 selfloop transitions, 14 changer transitions 0/124 dead transitions. [2023-11-10 12:24:45,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 124 transitions, 382 flow [2023-11-10 12:24:45,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:24:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:24:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 874 transitions. [2023-11-10 12:24:45,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7283333333333334 [2023-11-10 12:24:45,089 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 874 transitions. [2023-11-10 12:24:45,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 874 transitions. [2023-11-10 12:24:45,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:45,090 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 874 transitions. [2023-11-10 12:24:45,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 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) [2023-11-10 12:24:45,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2023-11-10 12:24:45,095 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2023-11-10 12:24:45,095 INFO L175 Difference]: Start difference. First operand has 112 places, 102 transitions, 227 flow. Second operand 10 states and 874 transitions. [2023-11-10 12:24:45,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 124 transitions, 382 flow [2023-11-10 12:24:45,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 124 transitions, 375 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-10 12:24:45,100 INFO L231 Difference]: Finished difference. Result has 115 places, 109 transitions, 286 flow [2023-11-10 12:24:45,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=286, PETRI_PLACES=115, PETRI_TRANSITIONS=109} [2023-11-10 12:24:45,102 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 8 predicate places. [2023-11-10 12:24:45,103 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 109 transitions, 286 flow [2023-11-10 12:24:45,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 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) [2023-11-10 12:24:45,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:45,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:45,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:24:45,104 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:45,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:45,106 INFO L85 PathProgramCache]: Analyzing trace with hash -772247651, now seen corresponding path program 1 times [2023-11-10 12:24:45,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356047324] [2023-11-10 12:24:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:45,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:24:45,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:45,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356047324] [2023-11-10 12:24:45,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356047324] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:24:45,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:24:45,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:24:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009279615] [2023-11-10 12:24:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:24:45,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:24:45,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:24:45,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:24:45,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 120 [2023-11-10 12:24:45,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 109 transitions, 286 flow. Second operand has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 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) [2023-11-10 12:24:45,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:45,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 120 [2023-11-10 12:24:45,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:45,413 INFO L124 PetriNetUnfolderBase]: 95/364 cut-off events. [2023-11-10 12:24:45,413 INFO L125 PetriNetUnfolderBase]: For 61/65 co-relation queries the response was YES. [2023-11-10 12:24:45,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 364 events. 95/364 cut-off events. For 61/65 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1468 event pairs, 57 based on Foata normal form. 4/336 useless extension candidates. Maximal degree in co-relation 472. Up to 160 conditions per place. [2023-11-10 12:24:45,416 INFO L140 encePairwiseOnDemand]: 107/120 looper letters, 27 selfloop transitions, 8 changer transitions 16/122 dead transitions. [2023-11-10 12:24:45,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 122 transitions, 415 flow [2023-11-10 12:24:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:24:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:24:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 870 transitions. [2023-11-10 12:24:45,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.725 [2023-11-10 12:24:45,419 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 870 transitions. [2023-11-10 12:24:45,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 870 transitions. [2023-11-10 12:24:45,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:45,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 870 transitions. [2023-11-10 12:24:45,421 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 87.0) internal successors, (870), 10 states have internal predecessors, (870), 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) [2023-11-10 12:24:45,423 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2023-11-10 12:24:45,424 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 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) [2023-11-10 12:24:45,424 INFO L175 Difference]: Start difference. First operand has 115 places, 109 transitions, 286 flow. Second operand 10 states and 870 transitions. [2023-11-10 12:24:45,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 122 transitions, 415 flow [2023-11-10 12:24:45,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 122 transitions, 411 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:24:45,428 INFO L231 Difference]: Finished difference. Result has 125 places, 103 transitions, 274 flow [2023-11-10 12:24:45,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=274, PETRI_PLACES=125, PETRI_TRANSITIONS=103} [2023-11-10 12:24:45,429 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 18 predicate places. [2023-11-10 12:24:45,429 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 103 transitions, 274 flow [2023-11-10 12:24:45,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.57142857142857) internal successors, (599), 7 states have internal predecessors, (599), 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) [2023-11-10 12:24:45,430 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:45,430 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:45,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:24:45,430 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:45,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:45,431 INFO L85 PathProgramCache]: Analyzing trace with hash -175493805, now seen corresponding path program 1 times [2023-11-10 12:24:45,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:45,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298614499] [2023-11-10 12:24:45,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:45,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:45,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:45,592 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:45,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:45,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298614499] [2023-11-10 12:24:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298614499] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:45,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337780210] [2023-11-10 12:24:45,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:45,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:45,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:24:45,596 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) [2023-11-10 12:24:45,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-10 12:24:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:45,696 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:24:45,703 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:24:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:45,840 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:24:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:45,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337780210] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:45,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:24:45,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:24:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949312111] [2023-11-10 12:24:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:24:45,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:24:45,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:24:45,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:24:45,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 120 [2023-11-10 12:24:45,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 103 transitions, 274 flow. Second operand has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 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) [2023-11-10 12:24:45,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:45,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 120 [2023-11-10 12:24:45,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:46,067 INFO L124 PetriNetUnfolderBase]: 76/275 cut-off events. [2023-11-10 12:24:46,068 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2023-11-10 12:24:46,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 275 events. 76/275 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 922 event pairs, 18 based on Foata normal form. 9/275 useless extension candidates. Maximal degree in co-relation 450. Up to 79 conditions per place. [2023-11-10 12:24:46,069 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 31 selfloop transitions, 7 changer transitions 0/109 dead transitions. [2023-11-10 12:24:46,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 109 transitions, 367 flow [2023-11-10 12:24:46,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:24:46,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:24:46,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2023-11-10 12:24:46,071 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2023-11-10 12:24:46,071 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2023-11-10 12:24:46,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2023-11-10 12:24:46,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:46,072 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2023-11-10 12:24:46,093 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 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) [2023-11-10 12:24:46,094 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-10 12:24:46,094 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-10 12:24:46,095 INFO L175 Difference]: Start difference. First operand has 125 places, 103 transitions, 274 flow. Second operand 7 states and 612 transitions. [2023-11-10 12:24:46,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 109 transitions, 367 flow [2023-11-10 12:24:46,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 109 transitions, 317 flow, removed 10 selfloop flow, removed 13 redundant places. [2023-11-10 12:24:46,100 INFO L231 Difference]: Finished difference. Result has 113 places, 105 transitions, 261 flow [2023-11-10 12:24:46,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=261, PETRI_PLACES=113, PETRI_TRANSITIONS=105} [2023-11-10 12:24:46,101 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 6 predicate places. [2023-11-10 12:24:46,102 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 105 transitions, 261 flow [2023-11-10 12:24:46,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 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) [2023-11-10 12:24:46,103 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:46,103 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:46,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-10 12:24:46,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:46,312 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:46,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:46,312 INFO L85 PathProgramCache]: Analyzing trace with hash 741612521, now seen corresponding path program 1 times [2023-11-10 12:24:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404562374] [2023-11-10 12:24:46,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:46,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:46,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404562374] [2023-11-10 12:24:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404562374] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:46,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758395578] [2023-11-10 12:24:46,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:46,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:46,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:24:46,423 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) [2023-11-10 12:24:46,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-10 12:24:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:46,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:24:46,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:24:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:46,572 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:24:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:46,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758395578] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:46,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:24:46,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:24:46,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930268080] [2023-11-10 12:24:46,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:24:46,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:24:46,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:46,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:24:46,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:24:46,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 120 [2023-11-10 12:24:46,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 105 transitions, 261 flow. Second operand has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 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) [2023-11-10 12:24:46,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:46,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 120 [2023-11-10 12:24:46,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:46,768 INFO L124 PetriNetUnfolderBase]: 63/259 cut-off events. [2023-11-10 12:24:46,769 INFO L125 PetriNetUnfolderBase]: For 87/105 co-relation queries the response was YES. [2023-11-10 12:24:46,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 259 events. 63/259 cut-off events. For 87/105 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 771 event pairs, 15 based on Foata normal form. 18/259 useless extension candidates. Maximal degree in co-relation 425. Up to 66 conditions per place. [2023-11-10 12:24:46,770 INFO L140 encePairwiseOnDemand]: 112/120 looper letters, 33 selfloop transitions, 7 changer transitions 0/111 dead transitions. [2023-11-10 12:24:46,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 111 transitions, 362 flow [2023-11-10 12:24:46,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:24:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:24:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 612 transitions. [2023-11-10 12:24:46,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7285714285714285 [2023-11-10 12:24:46,772 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 612 transitions. [2023-11-10 12:24:46,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 612 transitions. [2023-11-10 12:24:46,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:46,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 612 transitions. [2023-11-10 12:24:46,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 87.42857142857143) internal successors, (612), 7 states have internal predecessors, (612), 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) [2023-11-10 12:24:46,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-10 12:24:46,775 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 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) [2023-11-10 12:24:46,775 INFO L175 Difference]: Start difference. First operand has 113 places, 105 transitions, 261 flow. Second operand 7 states and 612 transitions. [2023-11-10 12:24:46,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 111 transitions, 362 flow [2023-11-10 12:24:46,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 111 transitions, 353 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 12:24:46,778 INFO L231 Difference]: Finished difference. Result has 117 places, 106 transitions, 280 flow [2023-11-10 12:24:46,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=280, PETRI_PLACES=117, PETRI_TRANSITIONS=106} [2023-11-10 12:24:46,780 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 10 predicate places. [2023-11-10 12:24:46,781 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 106 transitions, 280 flow [2023-11-10 12:24:46,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 85.85714285714286) internal successors, (601), 7 states have internal predecessors, (601), 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) [2023-11-10 12:24:46,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:46,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:46,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-10 12:24:46,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:46,991 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:46,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:46,991 INFO L85 PathProgramCache]: Analyzing trace with hash -736367365, now seen corresponding path program 1 times [2023-11-10 12:24:46,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:46,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078483018] [2023-11-10 12:24:46,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:46,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:47,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:47,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:47,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078483018] [2023-11-10 12:24:47,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078483018] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233898151] [2023-11-10 12:24:47,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:47,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:47,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:24:47,463 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) [2023-11-10 12:24:47,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-10 12:24:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:47,555 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-10 12:24:47,568 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:24:47,811 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-10 12:24:47,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:24:47,999 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:24:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:24:48,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:24:48,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:48,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233898151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:24:48,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:24:48,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 10] total 32 [2023-11-10 12:24:48,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419666454] [2023-11-10 12:24:48,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:24:48,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-10 12:24:48,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:48,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-10 12:24:48,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2023-11-10 12:24:48,272 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 120 [2023-11-10 12:24:48,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 106 transitions, 280 flow. Second operand has 32 states, 32 states have (on average 42.375) internal successors, (1356), 32 states have internal predecessors, (1356), 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) [2023-11-10 12:24:48,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:48,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 120 [2023-11-10 12:24:48,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:49,370 INFO L124 PetriNetUnfolderBase]: 1002/2056 cut-off events. [2023-11-10 12:24:49,370 INFO L125 PetriNetUnfolderBase]: For 1104/1104 co-relation queries the response was YES. [2023-11-10 12:24:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4895 conditions, 2056 events. 1002/2056 cut-off events. For 1104/1104 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12955 event pairs, 115 based on Foata normal form. 2/2050 useless extension candidates. Maximal degree in co-relation 4798. Up to 607 conditions per place. [2023-11-10 12:24:49,382 INFO L140 encePairwiseOnDemand]: 94/120 looper letters, 191 selfloop transitions, 71 changer transitions 8/303 dead transitions. [2023-11-10 12:24:49,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 303 transitions, 1459 flow [2023-11-10 12:24:49,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-10 12:24:49,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-10 12:24:49,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 1714 transitions. [2023-11-10 12:24:49,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37587719298245614 [2023-11-10 12:24:49,386 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 1714 transitions. [2023-11-10 12:24:49,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 1714 transitions. [2023-11-10 12:24:49,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:49,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 1714 transitions. [2023-11-10 12:24:49,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 45.10526315789474) internal successors, (1714), 38 states have internal predecessors, (1714), 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) [2023-11-10 12:24:49,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 120.0) internal successors, (4680), 39 states have internal predecessors, (4680), 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) [2023-11-10 12:24:49,395 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 120.0) internal successors, (4680), 39 states have internal predecessors, (4680), 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) [2023-11-10 12:24:49,395 INFO L175 Difference]: Start difference. First operand has 117 places, 106 transitions, 280 flow. Second operand 38 states and 1714 transitions. [2023-11-10 12:24:49,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 303 transitions, 1459 flow [2023-11-10 12:24:49,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 303 transitions, 1425 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-10 12:24:49,440 INFO L231 Difference]: Finished difference. Result has 166 places, 167 transitions, 750 flow [2023-11-10 12:24:49,441 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=750, PETRI_PLACES=166, PETRI_TRANSITIONS=167} [2023-11-10 12:24:49,441 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 59 predicate places. [2023-11-10 12:24:49,441 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 167 transitions, 750 flow [2023-11-10 12:24:49,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 42.375) internal successors, (1356), 32 states have internal predecessors, (1356), 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) [2023-11-10 12:24:49,442 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:49,442 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:49,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-10 12:24:49,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:49,643 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:49,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:49,643 INFO L85 PathProgramCache]: Analyzing trace with hash 872586617, now seen corresponding path program 2 times [2023-11-10 12:24:49,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:49,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274535790] [2023-11-10 12:24:49,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:49,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:50,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:50,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274535790] [2023-11-10 12:24:50,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274535790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:50,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216603820] [2023-11-10 12:24:50,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:24:50,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:50,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:24:50,072 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) [2023-11-10 12:24:50,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-10 12:24:50,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:24:50,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:24:50,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-10 12:24:50,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:24:50,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:50,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:24:50,399 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:24:50,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 14 [2023-11-10 12:24:50,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:50,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216603820] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:24:50,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:24:50,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 10] total 23 [2023-11-10 12:24:50,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198927659] [2023-11-10 12:24:50,472 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:24:50,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-10 12:24:50,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:50,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-10 12:24:50,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2023-11-10 12:24:50,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 120 [2023-11-10 12:24:50,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 167 transitions, 750 flow. Second operand has 23 states, 23 states have (on average 55.04347826086956) internal successors, (1266), 23 states have internal predecessors, (1266), 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) [2023-11-10 12:24:50,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:50,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 120 [2023-11-10 12:24:50,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:51,580 INFO L124 PetriNetUnfolderBase]: 1921/3863 cut-off events. [2023-11-10 12:24:51,580 INFO L125 PetriNetUnfolderBase]: For 7827/7827 co-relation queries the response was YES. [2023-11-10 12:24:51,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12136 conditions, 3863 events. 1921/3863 cut-off events. For 7827/7827 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 28922 event pairs, 141 based on Foata normal form. 2/3859 useless extension candidates. Maximal degree in co-relation 12091. Up to 700 conditions per place. [2023-11-10 12:24:51,609 INFO L140 encePairwiseOnDemand]: 97/120 looper letters, 239 selfloop transitions, 151 changer transitions 8/442 dead transitions. [2023-11-10 12:24:51,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 442 transitions, 2943 flow [2023-11-10 12:24:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-11-10 12:24:51,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2023-11-10 12:24:51,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2575 transitions. [2023-11-10 12:24:51,614 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4876893939393939 [2023-11-10 12:24:51,614 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 2575 transitions. [2023-11-10 12:24:51,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 2575 transitions. [2023-11-10 12:24:51,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:51,615 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 2575 transitions. [2023-11-10 12:24:51,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 58.52272727272727) internal successors, (2575), 44 states have internal predecessors, (2575), 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) [2023-11-10 12:24:51,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 120.0) internal successors, (5400), 45 states have internal predecessors, (5400), 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) [2023-11-10 12:24:51,626 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 120.0) internal successors, (5400), 45 states have internal predecessors, (5400), 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) [2023-11-10 12:24:51,626 INFO L175 Difference]: Start difference. First operand has 166 places, 167 transitions, 750 flow. Second operand 44 states and 2575 transitions. [2023-11-10 12:24:51,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 442 transitions, 2943 flow [2023-11-10 12:24:51,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 442 transitions, 2784 flow, removed 63 selfloop flow, removed 15 redundant places. [2023-11-10 12:24:51,649 INFO L231 Difference]: Finished difference. Result has 207 places, 282 transitions, 1984 flow [2023-11-10 12:24:51,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=1984, PETRI_PLACES=207, PETRI_TRANSITIONS=282} [2023-11-10 12:24:51,650 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 100 predicate places. [2023-11-10 12:24:51,650 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 282 transitions, 1984 flow [2023-11-10 12:24:51,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 55.04347826086956) internal successors, (1266), 23 states have internal predecessors, (1266), 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) [2023-11-10 12:24:51,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:51,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:51,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-10 12:24:51,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:51,856 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:51,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:51,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1509518097, now seen corresponding path program 3 times [2023-11-10 12:24:51,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:51,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629900087] [2023-11-10 12:24:51,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:51,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:24:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:24:52,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629900087] [2023-11-10 12:24:52,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629900087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:24:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664896405] [2023-11-10 12:24:52,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:24:52,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:52,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:24:52,377 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) [2023-11-10 12:24:52,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-10 12:24:52,448 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-10 12:24:52,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:24:52,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-10 12:24:52,452 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:24:52,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-10 12:24:52,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-10 12:24:52,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:52,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:24:52,993 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:24:52,993 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 30 [2023-11-10 12:24:52,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2023-11-10 12:24:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:24:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664896405] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:24:53,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:24:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 40 [2023-11-10 12:24:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480584527] [2023-11-10 12:24:53,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:24:53,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-11-10 12:24:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:24:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-11-10 12:24:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1416, Unknown=6, NotChecked=0, Total=1560 [2023-11-10 12:24:53,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 120 [2023-11-10 12:24:53,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 282 transitions, 1984 flow. Second operand has 40 states, 40 states have (on average 45.525) internal successors, (1821), 40 states have internal predecessors, (1821), 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) [2023-11-10 12:24:53,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:24:53,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 120 [2023-11-10 12:24:53,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:24:55,084 INFO L124 PetriNetUnfolderBase]: 2820/5639 cut-off events. [2023-11-10 12:24:55,084 INFO L125 PetriNetUnfolderBase]: For 20886/20894 co-relation queries the response was YES. [2023-11-10 12:24:55,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20833 conditions, 5639 events. 2820/5639 cut-off events. For 20886/20894 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 46197 event pairs, 103 based on Foata normal form. 8/5635 useless extension candidates. Maximal degree in co-relation 20765. Up to 1121 conditions per place. [2023-11-10 12:24:55,130 INFO L140 encePairwiseOnDemand]: 97/120 looper letters, 272 selfloop transitions, 216 changer transitions 8/534 dead transitions. [2023-11-10 12:24:55,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 534 transitions, 4560 flow [2023-11-10 12:24:55,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2023-11-10 12:24:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2023-11-10 12:24:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2225 transitions. [2023-11-10 12:24:55,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2023-11-10 12:24:55,133 INFO L72 ComplementDD]: Start complementDD. Operand 45 states and 2225 transitions. [2023-11-10 12:24:55,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 2225 transitions. [2023-11-10 12:24:55,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:24:55,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 2225 transitions. [2023-11-10 12:24:55,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 46 states, 45 states have (on average 49.44444444444444) internal successors, (2225), 45 states have internal predecessors, (2225), 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) [2023-11-10 12:24:55,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 46 states, 46 states have (on average 120.0) internal successors, (5520), 46 states have internal predecessors, (5520), 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) [2023-11-10 12:24:55,143 INFO L81 ComplementDD]: Finished complementDD. Result has 46 states, 46 states have (on average 120.0) internal successors, (5520), 46 states have internal predecessors, (5520), 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) [2023-11-10 12:24:55,143 INFO L175 Difference]: Start difference. First operand has 207 places, 282 transitions, 1984 flow. Second operand 45 states and 2225 transitions. [2023-11-10 12:24:55,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 534 transitions, 4560 flow [2023-11-10 12:24:55,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 534 transitions, 3840 flow, removed 343 selfloop flow, removed 14 redundant places. [2023-11-10 12:24:55,246 INFO L231 Difference]: Finished difference. Result has 249 places, 374 transitions, 2913 flow [2023-11-10 12:24:55,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=1606, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=155, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2913, PETRI_PLACES=249, PETRI_TRANSITIONS=374} [2023-11-10 12:24:55,247 INFO L281 CegarLoopForPetriNet]: 107 programPoint places, 142 predicate places. [2023-11-10 12:24:55,247 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 374 transitions, 2913 flow [2023-11-10 12:24:55,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 45.525) internal successors, (1821), 40 states have internal predecessors, (1821), 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) [2023-11-10 12:24:55,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:24:55,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 12:24:55,255 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-10 12:24:55,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:24:55,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-10 12:24:55,454 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:24:55,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1317716883, now seen corresponding path program 4 times [2023-11-10 12:24:55,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:24:55,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275649987] [2023-11-10 12:24:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:24:55,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:24:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 12:24:55,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 12:24:55,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 12:24:55,499 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 12:24:55,499 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 12:24:55,500 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-10 12:24:55,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-10 12:24:55,501 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-10 12:24:55,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 12:24:55,502 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-11-10 12:24:55,506 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 12:24:55,506 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 12:24:55,551 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated [2023-11-10 12:24:55,553 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~malloc15 [2023-11-10 12:24:55,553 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated [2023-11-10 12:24:55,554 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-10 12:24:55,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~ret8 [2023-11-10 12:24:55,555 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-10 12:24:55,558 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-10 12:24:55,559 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-10 12:24:55,560 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-10 12:24:55,561 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-11-10 12:24:55,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-10 12:24:55,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-10 12:24:55,562 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated [2023-11-10 12:24:55,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:24:55 BasicIcfg [2023-11-10 12:24:55,574 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 12:24:55,575 INFO L158 Benchmark]: Toolchain (without parser) took 12361.53ms. Allocated memory was 309.3MB in the beginning and 464.5MB in the end (delta: 155.2MB). Free memory was 262.2MB in the beginning and 162.7MB in the end (delta: 99.5MB). Peak memory consumption was 255.8MB. Max. memory is 8.0GB. [2023-11-10 12:24:55,575 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 12:24:55,575 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.58ms. Allocated memory is still 309.3MB. Free memory was 261.9MB in the beginning and 250.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-10 12:24:55,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 309.3MB. Free memory was 250.2MB in the beginning and 248.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:24:55,577 INFO L158 Benchmark]: Boogie Preprocessor took 23.48ms. Allocated memory is still 309.3MB. Free memory was 248.2MB in the beginning and 246.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-10 12:24:55,577 INFO L158 Benchmark]: RCFGBuilder took 421.45ms. Allocated memory is still 309.3MB. Free memory was 246.5MB in the beginning and 216.8MB in the end (delta: 29.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. [2023-11-10 12:24:55,577 INFO L158 Benchmark]: TraceAbstraction took 11673.14ms. Allocated memory was 309.3MB in the beginning and 464.5MB in the end (delta: 155.2MB). Free memory was 216.1MB in the beginning and 162.7MB in the end (delta: 53.4MB). Peak memory consumption was 209.6MB. Max. memory is 8.0GB. [2023-11-10 12:24:55,578 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 211.8MB. Free memory is still 165.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.58ms. Allocated memory is still 309.3MB. Free memory was 261.9MB in the beginning and 250.2MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 309.3MB. Free memory was 250.2MB in the beginning and 248.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.48ms. Allocated memory is still 309.3MB. Free memory was 248.2MB in the beginning and 246.5MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 421.45ms. Allocated memory is still 309.3MB. Free memory was 246.5MB in the beginning and 216.8MB in the end (delta: 29.7MB). Peak memory consumption was 30.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11673.14ms. Allocated memory was 309.3MB in the beginning and 464.5MB in the end (delta: 155.2MB). Free memory was 216.1MB in the beginning and 162.7MB in the end (delta: 53.4MB). Peak memory consumption was 209.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~malloc15 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~nondet17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~ret8 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem14 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 87]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] 0 int* A; VAL [A={0:0}] [L42] 0 int counter, N; VAL [A={0:0}, N=0, counter=0] [L75] 0 pthread_t t1, t2; VAL [A={0:0}, N=0, counter=0, t1={5:0}, t2={3:0}] [L77] 0 N = __VERIFIER_nondet_int() VAL [A={0:0}, N=1, counter=0, t1={5:0}, t2={3:0}] [L78] CALL, EXPR 0 create_fresh_int_array(N) [L93] CALL 0 assume_abort_if_not(size >= 0) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=1, \old(cond)=1, cond=1, counter=0] [L93] RET 0 assume_abort_if_not(size >= 0) [L94] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L38] COND FALSE 0 !(!cond) VAL [A={0:0}, N=1, \old(cond)=1, cond=1, counter=0] [L94] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L96] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, size=1] [L97] 0 int i = 0; VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L97] COND TRUE 0 i < size VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L98] 0 arr[i] = __VERIFIER_nondet_int() VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=0, size=1] [L97] 0 i++ VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L97] COND FALSE 0 !(i < size) VAL [A={0:0}, N=1, \old(size)=1, arr={-3:0}, counter=0, i=1, size=1] [L100] 0 return arr; VAL [A={0:0}, N=1, \old(size)=1, \result={-3:0}, arr={-3:0}, counter=0, size=1] [L78] RET, EXPR 0 create_fresh_int_array(N) [L78] 0 A = create_fresh_int_array(N) VAL [A={-3:0}, N=1, counter=0, t1={5:0}, t2={3:0}] [L81] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=1, counter=0, t1={5:0}, t2={3:0}] [L49] 1 int i=0; VAL [A={-3:0}, N=1, counter=0, i=0] [L49] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L38] COND FALSE 1 !(!cond) [L110] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L111] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L38] COND FALSE 1 !(!cond) [L111] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L112] 1 return a + b; [L51] RET, EXPR 1 plus(counter, A[i]) [L51] 1 int tmp = plus(counter, A[i]); [L62] 2 int i=0; VAL [A={-3:0}, N=1, counter=0, i=0] [L62] COND TRUE 2 i= b - 2147483648) [L38] COND FALSE 2 !(!cond) [L104] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L105] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L38] COND FALSE 2 !(!cond) [L105] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L106] 2 return a - b; [L64] RET, EXPR 2 minus(counter, A[i]) [L64] 2 int tmp = minus(counter, A[i]); [L67] 2 counter = tmp VAL [A={-3:0}, N=1, counter=-7, i=0, tmp=-7] [L62] 2 i++ VAL [A={-3:0}, N=1, counter=-7, i=1, tmp=-7] [L62] COND FALSE 2 !(i